Pages that link to "Item:Q5277920"
From MaRDI portal
The following pages link to Narrow Proofs May Be Maximally Long (Q5277920):
Displaying 12 items.
- Tight size-degree bounds for sums-of-squares proofs (Q1686838) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- Preprocessing of propagation redundant clauses (Q2104502) (← links)
- An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances (Q2980924) (← links)
- (Q3304105) (← links)
- Proof Complexity Meets Algebra (Q4617977) (← links)
- Short Proofs Are Hard to Find (Q5091243) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)
- Size-degree trade-offs for sums-of-squares and positivstellensatz proofs (Q5091776) (← links)
- Supercritical Space-Width Trade-offs for Resolution (Q5215515) (← links)
- MaxSAT Resolution and Subcube Sums (Q5875950) (← links)
- Preprocessing of propagation redundant clauses (Q6053844) (← links)
