Understanding cutting planes for QBFs (Q1784953): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q63378008, #quickstatements; #temporary_batch_1724713111024
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Anil K. Shukla / rank
Normal rank
 
Property / author
 
Property / author: Anil K. Shukla / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2887013560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width QBF is PSPACE-complete / 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: Q4790380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3620436 / 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: 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: Q4636589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5270089 / 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: Q5136303 / 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: Non-automatizability of bounded-depth Frege proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial size proofs of the propositional pigeonhole principle / 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: Edmonds polytopes and weakly hamiltonian graphs / 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: On the complexity of cutting-plane proofs / 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: Conformant planning as a case study of incremental QBF solving / 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: Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantic Versus Syntactic Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform constant-depth threshold circuits for division and iterated multiplication. / 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: Dual weak pigeonhole principle, Boolean complexity, and derandomization / 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: Some consequences of cryptographical conjectures for \(S_2^1\) and EF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning curves of the clipped Hebb rule for networks with binary weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open-WBO: A Modular MaxSAT Solver, / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / 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: Q4215637 / 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: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Propositional Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336120 / 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: Q4393484 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q63378008 / rank
 
Normal rank

Latest revision as of 00:06, 27 August 2024

scientific article
Language Label Description Also known as
English
Understanding cutting planes for QBFs
scientific article

    Statements

    Understanding cutting planes for QBFs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 September 2018
    0 references
    proof complexity
    0 references
    quantified Boolean formulas
    0 references
    cutting
    0 references
    planes
    0 references
    resolution
    0 references
    Frege proofs
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers