Application of matroid theory to the SAT problem

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2000, Pages 116-124

  Kullmann, Oliver ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; DECISION THEORY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

MATROID THEORY;

COMPUTATIONAL COMPLEXITY;

EID: 0033682348     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)