The polynomial-time hierarchy and sparse oracles
Journal of the ACM (JACM)
Relativizing complexity classes with sparse oracles
Journal of the ACM (JACM)
The strong exponential hierarchy collapses
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A taxonomy of complexity classes of functions
Journal of Computer and System Sciences
Semi-membership algorithms: some recent advances
ACM SIGACT News
Bounded queries, approximations, and the Boolean hierarchy
Information and Computation
Reducing the number of solutions of NP functions
Journal of Computer and System Sciences
Reducing the Number of Solutions of NP Functions
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Is the Standard Proof System for SAT P-Optimal?
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Information and Computation
Average-case intractability vs. worst-case intractability
Information and Computation
Reductions between disjoint NP-pairs
Information and Computation
Open questions in the theory of semifeasible computation
ACM SIGACT News
Cluster computing and the power of edge recognition
Information and Computation
The Shrinking Property for NP and coNP
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
PSPACE bounds for rank-1 modal logics
ACM Transactions on Computational Logic (TOCL)
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Nondeterministic functions and the existence of optimal proof systems
Theoretical Computer Science
Reductions between disjoint NP-Pairs
Information and Computation
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
The shrinking property for NP and coNP
Theoretical Computer Science
Cluster computing and the power of edge recognition
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Structural complexity of multiobjective NP search problems
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Survey: The consequences of eliminating NP solutions
Computer Science Review
Tractable counting of the answers to conjunctive queries
Journal of Computer and System Sciences
Functions Computable with Nonadaptive Queries to NP
Theory of Computing Systems
| Hi-index | 0.00 |