Satisfiability problem: Some polynomial classes of conjunctive normal forms

DOI10.1007/BF01125138zbMath0875.68495MaRDI QIDQ1816091

N. A. Parshina

Publication date: 18 December 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

satisfiabilityconjunctive normal forms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

This page was built for publication: Satisfiability problem: Some polynomial classes of conjunctive normal forms