Pages that link to "Item:Q1959382"
From MaRDI portal
The following pages link to On the automatizability of polynomial calculus (Q1959382):
Displaying 6 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Automatic computation of the complete root classification for a parametric polynomial (Q840716) (← links)
- Another look at degree lower bounds for polynomial calculus (Q2333803) (← links)
- A framework for space complexity in algebraic proof systems (Q2796410) (← links)
- Short Proofs Are Hard to Find (Q5091243) (← links)
- Automating Resolution is NP-Hard (Q5133983) (← links)