Width-based algorithms for SAT and CIRCUIT-SAT (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2919, Issue , 2004, Pages 162-171

  Broering, Elizabeth ^a   Lokam, Satyanarayana V ^a  

^a The Department of Civil and Environmental Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC TEST PATTERN GENERATION; FORESTRY; GRAPH ALGORITHMS; GRAPH THEORY; LEARNING ALGORITHMS; POLYNOMIAL APPROXIMATION; TIMING CIRCUITS; PARAMETER ESTIMATION;

BACKTRACK SEARCH; COMBINATORIAL PARAMETERS; EXTENDED ABSTRACTS; HYPERGRAPH; POLYNOMIAL-TIME; RESOLUTION REFUTATION; SAT-BASED; TREE-WIDTH;

PARAMETER ESTIMATION; ALGORITHMS;

EID: 26444484361     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24605-3_13     Document Type: Article

References (6)

1. Alekhnovich, M. and Razborov, A. : Satisfiability, Branch-width, and Tseitin Tautologies, 43rd Symp. Foundations of Computer Science. (FOCS), 593-603, 2002.
2. Bodlaender, H. L.: A Partial k-arboretum of Graphs with Bounded Treewidth, Theoretical Computer Science, 209, 1-45, 1998.
3. Cook, W. and Seymour, P. : Tour Merging via Branch-Decompistion, manuscript, December 18, 2002.
4. Prasad, M. R., Chong, P., and Keutzer, K.: Why is Combinatorial ATPG Efficiently Solvable for Practical VLSI Circuits?, Journal of Elecrtonic Testing: Theory and Applications, 17, 509-527, 2001.
5. Diestel, R.: Graph Theory, Second Edition, Graduate Texts in Mathematics 173, Springer, 2000.
6. Robertson, N. and Seymour, P. D.: Graph Minors X - Obstructions to Tree-decomposition, Jl. Combinatorial Theory, Series B, 52, 153-190, 1991.