|
Volumn , Issue , 1998, Pages 648-652
|
Tseitin's tautologies and lower bounds for Nullstellensatz proofs
|
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
POLYNOMIALS;
NULLSTELLENSATZ PROOFS;
TSEITIN TAUTOLOGIES;
THEOREM PROVING;
|
EID: 0032318061
PISSN: 02725428
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (28)
|
References (18)
|