Two new upper bounds for SAT

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1998, Pages 521-530

  Hirsch, Edward A ^a  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS; PROBLEM SOLVING;

UPPER BOUNDS;

ALGORITHMS;

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

References (15)