The complexity of promise problems with applications to public-key cryptography
Information and Control
Computational limitations of small-depth circuits
Computational limitations of small-depth circuits
On helping by robust oracle machines
Theoretical Computer Science
Complexity measures for public-key cryptosystems
SIAM Journal on Computing - Special issue on cryptography
Relativized polynomial time hierarchies having exactly K levels
SIAM Journal on Computing
SIAM Journal on Computing
Bounded queries to SAT and the Boolean hierarchy
Theoretical Computer Science
Introduction to the theory of complexity
Introduction to the theory of complexity
Promises and fault-tolerant database access
Complexity theory
Journal of Computer and System Sciences
Unambiguous computations and locally definable acceptance types
Theoretical Computer Science
Polynomials and combinatorial definitions of languages
Complexity theory retrospective II
A lower bound for perceptrons and an Oracle separation of the PPPH hierarchy
Journal of Computer and System Sciences
The complexity theory companion
The complexity theory companion
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Promise Problems and Access to Unambiguous Computation
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Borel sets and circuit complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On the Power of Unambiguity in Alternating Machines
Theory of Computing Systems
Separating the polynomial-time hierarchy by oracles
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Generic oracles and oracle classes
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to push forward some known constructs involving relativized unambiguity based complexity classes (UP and Promise- UP) to new constructs involving arbitrary levels of the relativized unambiguous polynomial hierarchy (UPH). Our techniques are developed on constraints imposed by hierarchical assembly of unambiguous nondeterministic polynomial-time Turing machines, and so our techniques differ substantially, in applicability and in nature, from standard techniques (such as the switching lemma [Hås87]), which are known to play roles in carrying out similar generalizations. Aside from achieving these generalizations, we resolve a question posed by Cai, Hemachandra, and Vyskoč [CHV93] on an issue related to nonadaptive Turing access to UP and adaptive smart Turing access to Promise-UP.