XSAT and NAE-SAT of linear CNF classes (Q2440094): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5589781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099676 / 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: New algorithms for exact satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms and hardness results for the clique packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of General Graph Factor Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Unsatisfiable <i>k</i>-CNF Formulas with Few Occurrences per Variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axioms and hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Non-Existence of Finite Projective Planes of Order 10 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4747916 / 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: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some SAT-Variants over Linear Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Linear XSAT-Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Variable-Weighted 2-SAT and Dual Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear CNF formulas and satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color critical hypergraphs with many edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsatisfiable Linear CNF Formulas Are Large and Complex. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002255 / rank
 
Normal rank

Latest revision as of 12:12, 7 July 2024

scientific article
Language Label Description Also known as
English
XSAT and NAE-SAT of linear CNF classes
scientific article

    Statements

    XSAT and NAE-SAT of linear CNF classes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 March 2014
    0 references
    not-all-equal satisfiability
    0 references
    exact satisfiability
    0 references
    linear formula
    0 references
    linear hypergraph
    0 references
    bicolorability
    0 references
    finite projective plane
    0 references
    counting problem
    0 references

    Identifiers