|
|
|
Volumn , Issue , 1995, Pages 36-40
|
|
Counting bottlenecks to show monotone P≠NP
a
a
NONE
|
|
Author keywords
[No Author keywords available]
|
|
Indexed keywords
BOOLEAN FUNCTIONS;
COMPUTATIONAL COMPLEXITY;
DIGITAL CIRCUITS;
GRAPH THEORY;
LOGIC GATES;
POLYNOMIALS;
PROBLEM SOLVING;
TURING MACHINES;
BOTTLENECK COUNTING;
ELEMENTARY COMBINATORICS;
EXPONENTIAL SIZE;
GRAPH RECOGNITION PROBLEM;
LOWER BOUNDS PROVING;
MONOTONE BOOLEAN CIRCUITS;
THEOREM PROVING;
|
|
EID: 0029516604
PISSN: 02725428
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
|
Times cited : (30)
|
|
References (8)
|
