The following pages link to Arist Kojevnikov (Q1777394):
Displayed 12 items.
- (Q991776) (redirect page) (← links)
- New upper bounds on the Boolean circuit complexity of symmetric functions (Q991778) (← links)
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
- Several notes on the power of Gomory-Chvátal cuts (Q2498920) (← links)
- (Q3181643) (← links)
- Circuit Complexity and Multiplicative Complexity of Boolean Functions (Q3576211) (← links)
- A new approach to proving upper bounds for MAX-2-SAT (Q3581524) (← links)
- Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities (Q3612456) (← links)
- Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies (Q3613770) (← links)
- (Q4475671) (← links)
- (Q4910741) (← links)
- Complexity of Semialgebraic Proofs with Restricted Degree of Falsity (Q5756572) (← links)