Sparse sets lowness and highness
SIAM Journal on Computing
Information and Computation
Query-limited reducibilities
Bi-immunity results for cheatable sets
Theoretical Computer Science
Lower bounds for the low hierarchy
Journal of the ACM (JACM)
Twenty questions to a p-selector
Information Processing Letters
Using self-reducibilities to characterize polynomial time
Information and Computation
The Extended Low Hierarchy Is an Infinite Hierarchy
SIAM Journal on Computing
Locating P/poly optimally in the extended low hierarchy
Theoretical Computer Science
Quantifying the amount of verboseness
Information and Computation
Information and Computation
Polynomial-time Membership Comparable Sets
SIAM Journal on Computing
Theoretical Computer Science
Quasi-linear truth-table reductions to p-selective sets
Theoretical Computer Science
Reducibility classes of P-selective sets
Theoretical Computer Science
Frequency computation and bounded queries
Theoretical Computer Science
P-selective sets and reducing search to decision vs. self-reducibility
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Theory of Semi-Feasible Algorithms
Theory of Semi-Feasible Algorithms
A structural property of regular frequency computations
Theoretical Computer Science
Towards a Cardinality Theorem for Finite Automata
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Counting, Selecting, adn Sorting by Query-Bounded Machines
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
On Polynomially D-Verbose Sets
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Comparing Verboseness for Finite Automata and Turing Machines
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Query complexity of membership comparable sets
Theoretical Computer Science
On the Reducibility of Sets Inside NP to Sets with Low Information Content
On the Reducibility of Sets Inside NP to Sets with Low Information Content
One query reducibilities between partial information classes
Theoretical Computer Science - Mathematical foundations of computer science 2004
Open questions in the theory of semifeasible computation
ACM SIGACT News
P-Selectivity, immunity, and the power of one bit
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Combining self-reducibility and partial information algorithms
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
In this survey we present partial information classes, which have been studied under different names and in different contexts in the literature. They are defined in terms of partial information algorithms. Such algorithms take a word tuple as input and yield a small set of possibilities for its characteristic string as output. We define a unified framework for the study of partial information classes and show how previous notions fit into the framework. The framework allows us to study the relationship of a large variety of partial information classes in a uniform way. We survey how partial information classes are related to other complexity theoretic notions like advice classes, lowness, bi-immunity, NP-completeness, and decidability.