Average-case completeness of a word problem for groups

Authors:
Jie Wang
Affiliations:
Department of Mathematical Sciences, University of North Carolina at Greensboro, Greensboro, NC
Venue:
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Year:
1995

Average case complete problems

SIAM Journal on Computing
A public key cryptosystem based on the word problem

Proceedings of CRYPTO 84 on Advances in cryptology
Expected computation time for Hamiltonian path problem

SIAM Journal on Computing
Random instances of a graph coloring problem are hard

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Average case completeness

Journal of Computer and System Sciences
On the theory of average case complexity

Journal of Computer and System Sciences
On average P vs. average NP

Complexity theory
On the NP-isomorphism problem with respect to random instances

Journal of Computer and System Sciences
Precise Average Case Complexity

STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science

LR(k) Testing is Average Case Complete

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Average-case intractability vs. worst-case intractability

Information and Computation

Hi-index	0.00