Average case complete problems
SIAM Journal on Computing
Structural complexity 1
Structural complexity 2
Journal of Computer and System Sciences
On the theory of average case complexity
Journal of Computer and System Sciences
Complexity theory
On the NP-isomorphism problem with respect to random instances
Journal of Computer and System Sciences
Average-case completeness of a word problem for groups
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Average-case computational complexity theory
Complexity theory retrospective II
On the complexity of LR(k) testing
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Structural Average Case Complexity
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Problems, complete in “average” instance
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Average-case intractability vs. worst-case intractability
Information and Computation
| Hi-index | 0.00 |
In this note, we show that LR(k) testing of context free grammars with respect to random instances is many-one complete for Distributional NP. The same result holds for testing whether a context free grammar is LL(k), strong LL(k), SLR(k), LC(k) or strong LC(k), respectively.