Abstract
A general framework is presente for the study of complexity classes that are defined via polynomial time algorithms that compute partial information about the characteristic function of a given input. Given n ∈ N and a family D of sets D⊂-{0,1}*, a language A is polynomially D-verbose (or: A ∈ P [D]) iff there is a polynomial time algorithm that on input (x 1,..., x n ) outputs a D ∈ D such that the characteristic string χa(x 1,..., x n ) is in D. Also the variant where only pairwise distinct input words are allowed is studied. p-selective sets, p-verbose sets, easily p-countable sets, sets that allow a polynomial time frequency computation, and cheatable sets are special cases of this definition. It is shown that it suffices to study families that are in a certain normal form. An algorithm is presented that decides for given families D 1, D 2 whether P [D 1] ⊂-P [D 2]. The classes P [D] are, except for trivial cases, not closed under union, intersection or join. The classes closed under complement are characterized, as well as those closed under ≤ p m - and ≤ p1−tt -reductions. For a given family of sets D the class of polynomially D-verbose languages contains non-recursive languages iff it contains all p-selective languages. The families D for which a D-verbose set can be non-recursive are fully characterized by a simple combinatorial property. It is also shown that for fixed n the classes form a distributive lattice. A diagram that shows this lattice for n=2 is presented.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. Amir, R. Beigel, and W. Gasarch. Some connections between bounded query classes and non-uniform complexity. In Proc. 5th Structure in Complexity Theory, 1990.
A. Amir and W. Gasarch. Polynomial terse sets. Information and Computation, 77, 1988.
J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. 1988.
R. Beigel, W. Gasarch, and E. Kinber. Frequency computation and bounded queries. In Proc. 10th Structure in Complexity Theory, 1995.
R. Beigel, M. Kummer, and F. Stephan. Quantifying the amount of verboseness. In Proc. Logical Found. of Comp. Sc. LNCS 620, 1992.
R. Beigel, M. Kummer, and F. Stephan. Approximable sets. In Proc. 9th Structure in Complexity Theory, 1994.
A. Hoene and A. Nickelsen. Counting, selecting, and sorting by query-bounded machines. In Proc. STACS 93. LNCS 665, 1993.
C. Jockusch, Jr. Semirecursive sets and positive reducibility. Trans. Amer. Math. Soc., 131, 1968.
M. Kummer and F. Stephan. The power of frequency computation. In FCT 95. LNCS 965, 1995.
M. Kummer. A proof of Beigel's cardinality conjecture. J. of Symb. Logic, 57(2), 1992.
M. Ogihara. Polynomial-time membership comparable sets. In Proc. 9th Structure in Complexity Theory, 1994.
S. Rogina. Kardinalitätsberechnungen. Studienarbeit, Universtät Karlsruhe, 1992.
A. Selman. Analogues of semirecursive sets and effective reducibilities to the study of NP complexity. Information and Control, 1, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nickelsen, A. (1997). On polynomially D verbose sets. In: Reischuk, R., Morvan, M. (eds) STACS 97. STACS 1997. Lecture Notes in Computer Science, vol 1200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023468
Download citation
DOI: https://doi.org/10.1007/BFb0023468
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62616-9
Online ISBN: 978-3-540-68342-1
eBook Packages: Springer Book Archive