NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability (Q3386749): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4650571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential separation between the parity principle and the pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4399249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3618853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finding Read-Once NAE-Resolution Refutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding read-once resolution refutations in systems of 2CNF clauses / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of read-once resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: XSAT and NAE-SAT of linear CNF classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color critical hypergraphs with many edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absorbing random walks and the NAE2SAT problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Propositional Proofs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1017/s096012952000016x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3097893064 / rank
 
Normal rank

Latest revision as of 10:38, 30 July 2024

scientific article
Language Label Description Also known as
English
NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability
scientific article

    Statements

    NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability (English)
    0 references
    7 January 2021
    0 references
    read-once
    0 references
    NAE-SAT
    0 references
    refutation
    0 references
    optimal-length refutation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references