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)
Semi-membership algorithms: some recent advances
ACM SIGACT News
Optimal Proof Systems and Sparse Sets
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Some connections between bounded query classes and non-uniform complexity
Information and Computation
| Hi-index | 0.00 |