Travelled to:
1 × Italy
1 × Portugal
1 × United Kingdom
2 × USA
Collaborated with:
A.S.Kulikov ∅ D.Itsykson E.Hirsch G.Yaroslavtsev
Talks about:
solver (2) proof (2) lower (2) bound (2) unit (2) use (2) sat (2) semialgebra (1) schrijver (1) tautolog (1)
Person: Arist Kojevnikov
DBLP: Kojevnikov:Arist
Contributed to:
Wrote 5 papers:
- SAT-2009-KojevnikovKY #performance #using
- Finding Efficient Circuits Using SAT-Solvers (AK, ASK, GY), pp. 32–44.
- SAT-2007-Kojevnikov #bound #linear
- Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities (AK), pp. 70–79.
- ICALP-v1-2006-KojevnikovI #bound #calculus #proving
- Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies (AK, DI), pp. 323–334.
- SAT-2006-KojevnikovK #algebra #complexity #proving #strict
- Complexity of Semialgebraic Proofs with Restricted Degree of Falsity (AK, ASK), pp. 11–21.
- SAT-2002-HirschK #named #satisfiability
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (EH, AK), p. 38.