The complexity of the max word problem and the power of one-way interactive proof systems

Authors:
Anne Condon
Affiliations:
-
Venue:
Computational Complexity
Year:
1993

Citing 0
Cited 3

Probabilistic checking of proofs: a new characterization of NP

Journal of the ACM (JACM)
The approximability of NP-hard problems

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Finite state verifiers with constant randomness

CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes

Quantified Score

Hi-index	0.00

Visualization

Abstract