Some consequences of the existence of pseudorandom generators
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
Journal of the ACM (JACM)
On polynomial time bounded truth-table reducibility of NP sets to sparse sets
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Lower bounds for the low hierarchy
Journal of the ACM (JACM)
ACM SIGACT News
On Boolean Lowness and Boolean Highness
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
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
Some connections between bounded query classes and non-uniform complexity
Information and Computation
Average-case intractability vs. worst-case intractability
Information and Computation
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Languages to diagonalize against advice classes
Computational Complexity
On Toda's Theorem in Structural Communication Complexity
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
Symmetry of information and nonuniform lower bounds
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
| Hi-index | 0.01 |