Pages that link to "Item:Q2817796"
From MaRDI portal
The following pages link to Time-space trade-offs in resolution: superpolynomial lower bounds for superlinear space (Q2817796):
Displaying 10 items.
- A simplified way of proving trade-off results for resolution (Q989569) (← links)
- Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs (Q1983330) (← links)
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- (Q4511222) (← links)
- Cumulative Space in Black-White Pebbling and Resolution (Q4638091) (← links)
- (Q4945238) (← links)
- Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs (Q5092411) (← links)
- Supercritical Space-Width Trade-offs for Resolution (Q5215515) (← links)
- Space characterizations of complexity measures and size-space trade-offs in propositional proof systems (Q6168323) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)