The following pages link to (Q4234107):
Displaying 12 items.
- Monotone real circuits are more powerful than monotone Boolean circuits (Q290209) (← links)
- On the complexity of cutting-plane proofs using split cuts (Q969513) (← links)
- An exponential lower bound for the size of monotone real circuits (Q1288204) (← links)
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← links)
- No feasible monotone interpolation for simple combinatorial reasoning (Q1575265) (← links)
- Polystability in positive characteristic and degree lower bounds for invariant rings (Q2102173) (← links)
- Several notes on the power of Gomory-Chvátal cuts (Q2498920) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- Input Proofs and Rank One Cutting Planes (Q4018154) (← links)
- Lower bounds for cutting planes proofs with small coefficients (Q4372903) (← links)
- (Q4375790) (← links)
- Natural proofs (Q5906823) (← links)