![]() |
Volumn , Issue , 1999, Pages 41-50
|
Fast approximate PCPs
a
|
Author keywords
[No Author keywords available]
|
Indexed keywords
APPROXIMATION THEORY;
FUNCTIONS;
MATHEMATICAL MODELS;
NETWORK PROTOCOLS;
OPTIMIZATION;
POLYNOMIALS;
PROBABILITY;
THEOREM PROVING;
POLYLOGARITHMIC TIME PROTOCOLS;
PROBABILISTIC CHECKING OF PROOFS (PCP);
COMPUTATIONAL COMPLEXITY;
|
EID: 0032629107
PISSN: 07349025
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/301250.301267 Document Type: Article |
Times cited : (20)
|
References (41)
|