Satisfiability Problem: Theory and Applications - DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By American Mathematical Society

9780821804797, 9781470439934

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A better upper bound for the unsatisfiability threshold

Satisfiability Problem: Theory and Applications - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/035/18 ◽

1997 ◽

pp. 643-648 ◽

Cited By ~ 2

Author(s):

Lefteris Kirousis ◽

Evangelos Kranakis ◽

D Krizanc

Keyword(s):

Upper Bound

Download Full-text

Worst-case analysis, 3-SAT decision, and lower bounds: Approaches for improved SAT algorithms

Satisfiability Problem: Theory and Applications - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/035/06 ◽

1997 ◽

pp. 261-313 ◽

Cited By ~ 8

Author(s):

Olivers Kullmann

Keyword(s):

Lower Bounds ◽

Case Analysis ◽

Worst Case Analysis ◽

Worst Case

Download Full-text

Surrogate constraint analysis—new heuristics and learning schemes for satisfiability problems

Satisfiability Problem: Theory and Applications - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/035/14 ◽

1997 ◽

pp. 537-572 ◽

Cited By ~ 8

Author(s):

Arne Lokketangen ◽

Fred Glover

Keyword(s):

Surrogate Constraint ◽

Satisfiability Problems ◽

Constraint Analysis ◽

Learning Schemes

Download Full-text

Some fundamental properties of Boolean ring normal forms

Satisfiability Problem: Theory and Applications - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/035/16 ◽

1997 ◽

pp. 587-602 ◽

Cited By ~ 3

Author(s):

Jieh Hsiang ◽

Guan Huang

Keyword(s):

Normal Forms ◽

Boolean Ring ◽

Fundamental Properties

Download Full-text

Propositional search efficiency and first-order theorem proving

Satisfiability Problem: Theory and Applications - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/035/08 ◽

1997 ◽

pp. 335-350

Author(s):

Daivd Plaisted ◽

Geoffrey Alexander

Keyword(s):

Theorem Proving ◽

Search Efficiency ◽

First Order

Download Full-text

Relative size of certain polynomial time solvable subclasses of satisfiability

Satisfiability Problem: Theory and Applications - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/035/04 ◽

1997 ◽

pp. 211-223 ◽

Cited By ~ 3

Author(s):

John Franco

Keyword(s):

Polynomial Time ◽

Relative Size

Download Full-text

Backtracking and probing

Satisfiability Problem: Theory and Applications - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/035/03 ◽

1997 ◽

pp. 153-209

Author(s):

Paul Purdom ◽

G Haven

Download Full-text

Algorithms for the satisfiability (SAT) problem: A survey

Satisfiability Problem: Theory and Applications - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/035/02 ◽

1997 ◽

pp. 19-151 ◽

Cited By ~ 103

Author(s):

Jun Gu ◽

Paul Purdom ◽

John Franco ◽

Benjamin Wah

Keyword(s):

Sat Problem

Download Full-text

The polynomial time decidability of simulation relations for finite state processes: A HORNSAT based approach

Satisfiability Problem: Theory and Applications - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/035/17 ◽

1997 ◽

pp. 603-641 ◽

Cited By ~ 4

Author(s):

Sandeep Shukla ◽

Daniel Rosenkrantz ◽

Harry Hunt ◽

Richard Stearns

Keyword(s):

Polynomial Time ◽

Finite State ◽

Simulation Relations

Download Full-text

Complexity of hierarchically and 1-dimensional periodically specified problems. I: Hardness results

Satisfiability Problem: Theory and Applications - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/035/05 ◽

1997 ◽

pp. 225-259 ◽

Cited By ~ 1

Author(s):

Madhav Marathe ◽

Harry Hunt ◽

Richard Stearns ◽

Vankatesh Radhakrishnan

Download Full-text

Satisfiability Problem: Theory and Applications - DIMACS Series in Discrete Mathematics and Theoretical Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By American Mathematical Society

A better upper bound for the unsatisfiability threshold

Worst-case analysis, 3-SAT decision, and lower bounds: Approaches for improved SAT algorithms

Surrogate constraint analysis—new heuristics and learning schemes for satisfiability problems

Some fundamental properties of Boolean ring normal forms

Propositional search efficiency and first-order theorem proving

Relative size of certain polynomial time solvable subclasses of satisfiability

Backtracking and probing

Algorithms for the satisfiability (SAT) problem: A survey

The polynomial time decidability of simulation relations for finite state processes: A HORNSAT based approach

Complexity of hierarchically and 1-dimensional periodically specified problems. I: Hardness results

Satisfiability Problem: Theory and Applications - DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Latest Publications