Pages that link to "Item:Q1601038"
From MaRDI portal
The following pages link to A complexity gap for tree resolution (Q1601038):
Displayed 15 items.
- Relativization makes contradictions harder for resolution (Q386151) (← links)
- The limits of tractability in resolution-based propositional proof systems (Q408157) (← links)
- Parameterized proof complexity (Q451111) (← links)
- Cutting planes and the parameter cutwidth (Q693047) (← links)
- On the Chvátal rank of the pigeonhole principle (Q1029351) (← links)
- Towards a unified complexity theory of total functions (Q1745728) (← links)
- Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems (Q1947040) (← links)
- The treewidth of proofs (Q2013559) (← links)
- Partially definable forcing and bounded arithmetic (Q2257103) (← links)
- A combinatorial characterization of resolution width (Q2475405) (← links)
- Parameterized Bounded-Depth Frege Is Not Optimal (Q3012838) (← links)
- Cutting Planes and the Parameter Cutwidth (Q3576046) (← links)
- Resolution Width and Cutting Plane Rank Are Incomparable (Q3599159) (← links)
- Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
- LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE (Q5501765) (← links)