On-line 2-satisfiability

DOI10.1007/BF01531076zbMath0875.68437MaRDI QIDQ1356216

Brigitte Jaumard, Bruno Simeone, Rossella Petreschi, Paola Marchioro, Aurora Morgana

Publication date: 9 November 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items

Some combinatorial optimization problems arising from VLSI circuit design

Cites Work

• Unnamed Item
• On-line computation of transitive closures of graphs
• Amortized efficiency of a path retrieval data structure
• A switching algorithm for the solution of quadratic Boolean equations
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Single bend wiring
• Experimental comparison of 2-satisfiability algorithms
• On the Complexity of Timetable and Multicommodity Flow Problems
• The complexity of theorem-proving procedures