|
|
|
Volumn , Issue , 1996, Pages 88-96
|
|
Reducing P to a sparse set using a constant number of queries collapses P to L
|
|
Author keywords
[No Author keywords available]
|
|
Indexed keywords
COMPUTATION THEORY;
DECISION TABLES;
ERROR ANALYSIS;
MATHEMATICAL MODELS;
POLYNOMIALS;
QUERY LANGUAGES;
RANDOM PROCESSES;
SET THEORY;
THEOREM PROVING;
LOGSPACE COMPUTABLE BOUNDED TRUTH TABLE REDUCTIONS;
MULTIPLE ACCESS MODEL;
PROOF TECHNIQUES;
SPARSE HARD SET;
TWO SIDED ERROR RANDOMIZED TECHNIQUES;
COMPUTATIONAL COMPLEXITY;
|
|
EID: 0029698371
PISSN: 10930159
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
|
Times cited : (4)
|
|
References (18)
|
