Linear CNF formulas and satisfiability
type: Item
instance of: scholarly article
title: Linear CNF formulas and satisfiability
zbMATH Open document ID: 1186.68223
author: Stefan Porschen
author: Ewald Speckenmeyer
author: Xishun Zhao
published in: Discrete Applied Mathematics
publication date: 2009-06-30T00:00:00Z
full work available at URL: zaik2006-520.pdf
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 5572530
zbMATH Keywords: linear CNF formula
zbMATH Keywords: satisfiability
zbMATH Keywords: NP-completeness
zbMATH Keywords: resolution
zbMATH Keywords: Latin square
zbMATH Keywords: finite projective plane
MaRDI profile type: Publication
OpenAlex ID: W2065657706
cites work: Q4099676
cites work: Q3995743
cites work: A fast parallel SAT-solver -- efficient workload balancing
cites work: Q3726125
cites work: Q4393480
cites work: Q4101818
cites work: A perspective on certain polynomial-time solvable classes of satisfiability
cites work: On Representatives of Subsets
cites work: Topics on Steiner systems. Ed. by C. C. Lindner and A. Rosa
cites work: Determining computational complexity from characteristic ‘phase transitions’
cites work: A short proof of Fisher's inequality
cites work: A CNF Class Generalizing Exact Linear Formulas
cites work: An extension of a theorem of the Bruijn and Erdős on combinatorial designs
cites work: Q3851094
cites work: A simplified NP-complete satisfiability problem
cites work: Q4002255
cites work: An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
DOI: 10.1016/J.DAM.2008.03.031
description: scientific article; zbMATH DE number 5572530