|
Volumn , Issue , 1993, Pages 82-95
|
Polynomial method in circuit complexity
a |
Author keywords
[No Author keywords available]
|
Indexed keywords
BOOLEAN FUNCTIONS;
COMBINATORIAL MATHEMATICS;
COMPUTATIONAL COMPLEXITY;
LOGIC CIRCUITS;
POLYNOMIALS;
TURING MACHINES;
LOGIC CIRCUIT COMPLEXITY;
ORACLE MACHINES;
POLYNOMIAL BOOLEAN FUNCTIONS;
POLYNOMIAL-TIME TURING MACHINES;
SMALL-DEPTH CIRCUIT THEORY;
THRESHOLD CIRCUIT BOUNDS;
TURING MACHINE COMPLEXITY CLASSES;
SET THEORY;
|
EID: 0027204515
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (129)
|
References (58)
|