The treewidth of proofs (Q2013559): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Space Complexity in Propositional Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial characterization of resolution width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially definable forcing and bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs in resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-Space Tradeoffs for Resolution / 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: Parity Games and Propositional Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of size-width tradeoffs for resolution / 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: Q5306365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The limits of tractability in resolution-based propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativization makes contradictions harder for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of resolution with bounded conjunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space bounds for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Small Space to Small Width in Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Digraph Width Measures in Parameterized Algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation number of a graph equals its path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching and pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds to the size of constant-depth propositional proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of first order structures and propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph decompositions and monotonicity in digraph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Space in Proof Complexity: Treewidth and Pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Narrow Proofs May Be Spacious:Separating Space and Width in Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3689182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution lower bounds for the weak functional pigeonhole principle. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Kind of Tradeoffs in Propositional Proof Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complexity gap for tree resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential separation between Res(\(k\)) and Res(\(k+1\)) for \(k \leqslant \varepsilon\log n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Propositional Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Switching Lemma for Small Restrictions and Lower Bounds for <i>k</i>-DNF Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short resolution proofs for a sequence of tricky formulas / rank
 
Normal rank

Revision as of 05:16, 14 July 2024

scientific article
Language Label Description Also known as
English
The treewidth of proofs
scientific article

    Statements

    The treewidth of proofs (English)
    0 references
    0 references
    0 references
    8 August 2017
    0 references
    proof complexity
    0 references
    infinity axioms
    0 references
    treewidth
    0 references
    pathwidth
    0 references
    resolution
    0 references
    proof space
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers