Probabilistically checkable proofs and their consequences for approximation algorithms

Authors:
S. Hougardy;H. J. Prömel;A. Steger
Affiliations:
-;-;-
Venue:
Discrete Mathematics - Special issue: trends in discrete mathematics
Year:
1994

Citing 0
Cited 2

Cryptography 2000±10

Informatics - 10 Years Back. 10 Years Ahead.
Probabilistically Checkable Proofs Over the Reals

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract