Average case complete problems
SIAM Journal on Computing
Many hard examples for resolution
Journal of the ACM (JACM)
Random instances of a graph coloring problem are hard
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
On the theory of average case complexity
Journal of Computer and System Sciences
Randomizing reductions of search problems
SIAM Journal on Computing
Average-case computational complexity theory
Complexity theory retrospective II
Distributional Word Problem for Groups
SIAM Journal on Computing
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
| Hi-index | 0.01 |
How many tests does one have to perform in order to compute an ε-approximation of a zero of a function f out of a given class of continuous functions on the unit interval, for a given ε