On 2-QBF truth testing in parallel

DOI10.1016/0020-0190(95)00180-8zbMath1022.68737OpenAlexW1983773441MaRDI QIDQ672737

Robert Storlind, Christos Levcopoulos, Bengt Aspvall, Andrzej Lingas

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00180-8

zbMATH Keywords

parallel algorithmssatisfiability2-cnf2-qbfquantified boolean formula

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• Uniquely solvable quadratic Boolean equations
• A fast and efficient parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula
• An efficiently solvable graph partition problem to which many problems are reducible

This page was built for publication: On 2-QBF truth testing in parallel