On-line 2-satisfiability
type: Item
instance of: scholarly article
title: On-line 2-satisfiability
zbMATH Open document ID: 0875.68437
DOI: 10.1007/BF01531076
author: Brigitte Jaumard
author: Paola Marchioro
author: Aurora Morgana
author: Rossella Petreschi
author: Bruno Simeone
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1997-11-09T00:00:00Z
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 1017066
MaRDI profile type: Publication
cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
cites work: The complexity of theorem-proving procedures
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: On-line computation of transitive closures of graphs
cites work: Amortized efficiency of a path retrieval data structure
cites work: A switching algorithm for the solution of quadratic Boolean equations
cites work: Experimental comparison of 2-satisfiability algorithms
cites work: Single bend wiring
cites work: Q3732977
description: scientific article; zbMATH DE number 1017066