Abstract
We study the closure properties of the function classes GapP and GapP+. We characterize the property of GapP+ being closed under decrement and of GapP being closed under maximum, minimum, median, or division by seemingly implausible collapses among complexity classes, thereby giving evidence that these function classes don't have the stated closure properties.
We show a similar result concerning operations we callbit cancellation andbit insertion: Given a functionf ∈ GapP and a polynomialtime computable function κ, we ask whether the functionsf * (x) andf + (x) are in GapP or not, wheref * (x) is obtained fromf(x) by cancelling the κ(x)-th bit in the binary representation off(x), andf + (x) is obtained fromf(x) by inserting a bit at position κ(x) in the binary representation off(x). We give necessary and sufficient conditions for GapP being closed under bit cancellation and bit insertion, respectively.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Balcázar, J. Díaz, and J. Gabarró,Structural Complexity I. EATCS Monographs on Theoret. Comput. Sci., Springer-Verlag, 1988.
J. Balcázar, J. Díaz, and J. Gabarró,Structural Complexity II. EATCS Monographs on Theoret. Comput. Sci., Springer-Verlag, 1991.
R. Beigel, J. Gill, and U. Hertrampf, Counting classes: Thresholds, parity, mods, and fewness. InProc. 7th Ann. Symp. Theoret. Aspects of Comput. Sci., Springer-Verlag, Lecture Notes in Computer Science #415, 1990, 49–57.
R. Beigel, N. Reingold, and D. Spielman, PP is closed under intersection. InProc. Twenty-third Ann. ACM Symp. Theor. Comput., 1991, 1–9.
S. Fenner, L. Fortnow, and S. Kurtz, Gap-definable counting classes. InProc. 6th Structure in Complexity Theory IEEE, 1991, 30–42.
L. Fortnow and N. Reingold, PP is closed under truth-table reductions. InProc. 6th Structure in Complexity Theory IEEE, 1991, 13–15.
J. Gill, Computational complexity of probabilistic Turing machines.SIAM J. Comput. 6 (4) (1977), 675–695.
L. Goldschlager andI. Parberry, On the construction of parallel computers from various bases of boolean functions.Theoret. Comput. Sci. 43 (1986), 43–58.
F. Green, J. Köbler, K.W. Regan, T. Schwentick, and J. Torán, The power of the middle bit of a #P function. To appear inJ. Comput. System Sci..
S. Gupta, The power of witness reduction. InProc. 6th Structure in Complexity Theory IEEE, 1991, 43–59.
S. Gupta, On the closure of certain function classes under integer division by polynomial-bounded functions.Inform. Process. Lett. 44 (1992), 205–210.
J. Köbler, U. Schöning, andJ. Torán, Graph isomorphism is low for PP.Comput Complexity 2 (1992), 301–330.
M. Ogiwara andL. Hemachandra, A complexity theory for feasible closure properties.J. Comput. System Sci. 46 (3) (1993), 295–325.
C. Papadimitriou and S. Zachos, Two remarks on the power of counting. InProc. 6th GI Conf. Theoret. Comput. Sci., Springer-Verlag, Lecture Notes in Computer Science #145, 1983, 269–276.
U. Schöning, The power of counting.Complexity Theory Retrospective, ed.A. Selman, Springer-Verlag, 1990, 204–223.
J. Simon,On Some Central Problems in Computational Complexity. PhD thesis, Cornell University, Ithaca, N.Y., January, 1975. Available as Cornell Department of Computer Science Technical Report TR75-224.
L. Stockmeyer, The polynomial-time hierarchy.Theoret. Comput. Sci. 3 (1977), 1–22.
S. Toda, PP is as hard as the polynomial-time hierarchy.SIAM J. Comput. 20 (1991), 865–877.
J. Torán, Complexity classes defined by counting quantifiers.J. Assoc. Comput. Mach. 38 (3) (1991), 753–774.
L. Valiant, The complexity of enumeration and reliability problems.SIAM J. Comput. 8 (3) (1979), 410–421.
K. Wagner, Some observations on the connection between counting and recursion.Theoret. Comput. Sci. 47 (1986), 131–147.
K. Wagner, The complexity of combinatorial problems with succinct input representations.Acta Infor. 23 (1986), 325–356.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Thierauf, T., Toda, S. & Watanabe, O. On closure properties of GapP. Comput Complexity 4, 242–261 (1994). https://doi.org/10.1007/BF01206638
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01206638