Lower Bound Techniques for QBF Proof Systems (Q3304096): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(7 intermediate revisions by 3 users not shown)
label / enlabel / en
 
Lower Bound Techniques for QBF Proof Systems
Property / describes a project that uses
 
Property / describes a project that uses: QUBE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QuBE++ / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: RAReQS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CAQE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Quaffle / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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: Short proofs are narrow—resolution made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3304106 / 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: Q5270089 / 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: An algorithm to evaluate quantified Boolean formulae and its experimental evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexample-guided abstraction refinement for symbolic model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Methods in Computer-Aided Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving QBF with Counterexample Guided Refinement / 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: A Non-prenex, Non-clausal QBF Solver with Game-State Learning / 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: Lower bounds for resolution and cutting plane proofs and monotone computations / 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 / full work available at URL
 
Property / full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8536/pdf/LIPIcs-STACS-2018-2.pdf/ / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2789336854 / rank
 
Normal rank
Property / title
 
Lower Bound Techniques for QBF Proof Systems (English)
Property / title: Lower Bound Techniques for QBF Proof Systems (English) / rank
 
Normal rank

Latest revision as of 10:56, 30 July 2024

scientific article
Language Label Description Also known as
English
Lower Bound Techniques for QBF Proof Systems
scientific article

    Statements

    0 references
    5 August 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    proof complexity
    0 references
    quantified Boolean formulas
    0 references
    resolution
    0 references
    lower bound techniques
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Lower Bound Techniques for QBF Proof Systems (English)
    0 references