A simple parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula

Authors:
Stephen A. Cook;Michael Luby
Affiliations:
Univ. of Toronto, Toronto, Ont., Canada;Univ. of Toronto, Toronto, Ont., Canada
Venue:
Information Processing Letters
Year:
1988

Citing 0
Cited 2

On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope

AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Paper: An efficient procedure for theorem proving in propositional logic on vector computers

Parallel Computing

Quantified Score

Hi-index	0.89

Visualization

Abstract