Pages that link to "Item:Q1432645"
From MaRDI portal
The following pages link to Lower bounds for polynomial calculus in the case of nonbinomial ideals. (Q1432645):
Displaying 6 items.
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas (Q862399) (← links)
- Characterization of robust immune symmetric Boolean functions (Q892387) (← links)
- Algebraic proof systems over formulas. (Q1401356) (← links)
- On the automatizability of polynomial calculus (Q1959382) (← links)
- Algebraic Attacks against Random Local Functions and Their Countermeasures (Q4600698) (← links)