On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} (Q1949746): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Resolution for quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existentially restricted quantified constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Satisfiability of Small Depth Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Randomized Algorithms for 3-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved exponential-time algorithm for <i>k</i> -SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3507036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic algorithm for \(k\)-SAT based on limited local search and restart / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the satisfiability problem of formulas in conjunctive normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828947 / rank
 
Normal rank

Latest revision as of 11:17, 6 July 2024

scientific article
Language Label Description Also known as
English
On the exact complexity of evaluating quantified \(k\)-\textsc{cnf}
scientific article

    Statements

    On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 May 2013
    0 references
    quantified Boolean formulas
    0 references
    satisfiability
    0 references

    Identifiers