Linear CNF formulas and satisfiability (Q1028433): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Zhao, Xishun / rank
Normal rank
 
Property / author
 
Property / author: Zhao, Xishun / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065657706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel SAT-solver -- efficient workload balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A perspective on certain polynomial-time solvable classes of satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics on Steiner systems. Ed. by C. C. Lindner and A. Rosa / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining computational complexity from characteristic ‘phase transitions’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Fisher's inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CNF Class Generalizing Exact Linear Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of a theorem of the Bruijn and Erdős on combinatorial designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures / rank
 
Normal rank

Latest revision as of 18:15, 1 July 2024

scientific article
Language Label Description Also known as
English
Linear CNF formulas and satisfiability
scientific article

    Statements

    Linear CNF formulas and satisfiability (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2009
    0 references
    0 references
    linear CNF formula
    0 references
    satisfiability
    0 references
    NP-completeness
    0 references
    resolution
    0 references
    Latin square
    0 references
    finite projective plane
    0 references
    0 references