Hardness Characterisations and Size-width Lower Bounds for QBF Resolution (Q5886517): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Henkin quantifiers and Boolean formulae: a certification perspective of DQBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified QBF certification and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790380 / 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: On the correspondence between arithmetic theories and propositional proof systems – a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4625702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2954985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Resolution-Based QBF Calculi and Their Proof Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5270089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are Short Proofs Narrow? QBF Resolution Is <i>Not</i> So 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: Reasons for Hardness in QBF Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof systems that take advice / 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: A subexponential exact learning algorithm for DNF using equivalence queries / 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating size and width in variants of Q-resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5306365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conformant planning as a case study of incremental QBF solving / 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: Circuit Complexity, Proof Complexity, and Polynomial Identity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / 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: On the computational power of Boolean decision lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: \({\textsf{QRAT}}^{+}\): generalizing QRAT by a more powerful QBF redundancy property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q-Resolution with Generalized Axioms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust QBF Encodings for Sequential Circuits with Applications to Verification, Debug, and Test / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition / 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: The Complexity of Propositional Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5868872 / rank
 
Normal rank

Latest revision as of 20:44, 31 July 2024

scientific article; zbMATH DE number 7672669
Language Label Description Also known as
English
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution
scientific article; zbMATH DE number 7672669

    Statements

    Hardness Characterisations and Size-width Lower Bounds for QBF Resolution (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 April 2023
    0 references
    quantified Boolean formulas
    0 references
    proof complexity
    0 references
    size-width tradeoff
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references