On-line 2-satisfiability

DOI10.1007/BF01531076MaRDI QIDQ1356216zbMATH OpenFDO

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

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)

Cites work

• scientific article; zbMATH DE number 3965458 (Why is no real title available?)
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• A switching algorithm for the solution of quadratic Boolean equations
• Amortized efficiency of a path retrieval data structure
• Experimental comparison of 2-satisfiability algorithms
• On the Complexity of Timetable and Multicommodity Flow Problems
• On-line computation of transitive closures of graphs
• Single bend wiring
• The complexity of theorem-proving procedures

Cited in

(1)

• Some combinatorial optimization problems arising from VLSI circuit design

This page was built for publication: On-line 2-satisfiability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356216)