A game characterisation of tree-like Q-resolution size (Q2424676): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q61835449, #quickstatements; #temporary_batch_1710897659913
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A combinatorial characterization of resolution width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified QBF certification and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: QBF Resolution Systems and Their Proof Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for bounded depth Frege proofs via Pudlák-Buss games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs are narrow—resolution made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3620436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Unification of QBF Resolution-Based Calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2954985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasible Interpolation for QBF Resolution Calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are Short Proofs Narrow? QBF Resolution is not Simple. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Game Characterisation of Tree-like Q-resolution Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of tree-like resolution size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of DPLL Search Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified Characterisations of Resolution Hardness Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding Gentzen and Frege Systems for QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards NP-P via proof complexity and search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5306365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sequent Systems and Resolution for QBFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial characterization of treelike resolution space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Q-Resolution and CDCL QBF Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expansion-based QBF solving versus Q-resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution for quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Driven XOR-Clause Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for resolution and cutting plane proofs and monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs as Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Propositional Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the Theory of Practical Quantified Boolean Formula Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809068 / rank
 
Normal rank

Latest revision as of 16:07, 19 July 2024

scientific article
Language Label Description Also known as
English
A game characterisation of tree-like Q-resolution size
scientific article

    Statements

    A game characterisation of tree-like Q-resolution size (English)
    0 references
    0 references
    0 references
    0 references
    25 June 2019
    0 references
    proof complexity
    0 references
    resolution
    0 references
    prover-delayer games
    0 references
    QBF
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers