Arist Kojevnikov

Most-cited papers

1. UnitWalk: A new SAT solver that uses local search guided by unit clause elimination

   E. A. Hirsch, Arist Kojevnikov

   2005Annals of Mathematics and Artificial Intelligence131 citations

   Semantic Scholar

   Save

2. Finding Efficient Circuits Using SAT-Solvers

   Arist Kojevnikov, A. Kulikov, G. Yaroslavtsev

   2009International Conference on Theory and Applications of Satisfiability Testing50 citations

   Semantic Scholar

   Save

3. A new approach to proving upper bounds for MAX-2-SAT

   Arist Kojevnikov, A. Kulikov

   2006ACM-SIAM Symposium on Discrete Algorithms41 citations

   Semantic Scholar

   Save

4. New upper bounds on the Boolean circuit complexity of symmetric functions

   Evgeny Demenkov, Arist Kojevnikov, A. Kulikov, G. Yaroslavtsev

   2010Information Processing Letters35 citations

   Semantic Scholar

   Save

5. Several notes on the power of Gomory-Chvátal cuts

   E. A. Hirsch, Arist Kojevnikov

   2006Annals of Pure and Applied Logic33 citations Open access

   Semantic Scholar

   Save

6. Lower bounds on static Lovász-Schrijver calculus proofs for Tseitin tautologies

   D. Itsykson, Arist Kojevnikov

   200729 citations

   Semantic Scholar

   Save

7. Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies

   Arist Kojevnikov, D. Itsykson

   2006International Colloquium on Automata, Languages and Programming24 citations

   Semantic Scholar

   Save

8. Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination

   E. A. Hirsch, Arist Kojevnikov

   2001International Conference on Principles and Practice of Constraint Programming20 citations

   Semantic Scholar

   Save

9. Circuit Complexity and Multiplicative Complexity of Boolean Functions

   Arist Kojevnikov, A. Kulikov

   2010Conference on Computability in Europe18 citations

   Semantic Scholar

   Save

10. Intuitionistic Frege systems are polynomially equivalent

    G. Mints, Arist Kojevnikov

    200616 citations

    Semantic Scholar

    Save

11. Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities

    Arist Kojevnikov

    2007International Conference on Theory and Applications of Satisfiability Testing8 citations

    Semantic Scholar

    Save

12. New Combinatorial Complete One-Way Functions

    Arist Kojevnikov, S. Nikolenko

    2008Symposium on Theoretical Aspects of Computer Science5 citations

    Semantic Scholar

    Save

13. Algebraic cryptography: New constructions and their security against provable break

    D. Grigoriev, Arist Kojevnikov, S. Nikolenko

    20094 citations Open access

    Semantic Scholar

    Save

14. Complexity of Semialgebraic Proofs with Restricted Degree of Falsity

    E. A. Hirsch, Arist Kojevnikov, A. Kulikov, S. Nikolenko

    2006Journal on Satisfiability, Boolean Modeling and Computation3 citations Open access

    Semantic Scholar

    Save

15. Invariant-based Cryptosystems and Their Security Against Provable Worst-Case Break ?

    D. Grigoriev, Arist Kojevnikov, S. Nikolenko

    20072 citations

    Semantic Scholar

    Save

16. Lower Bounds on Formula Size of Error-Correcting Codes ?

    Arist Kojevnikov, A. Kulikov

    20071 citations

    Semantic Scholar

    Save

17. Distributional Word Problem for Tseitin Semigroup

    Arist Kojevnikov, I. Monakhov, Sergey Naumov

    0 citations

    Semantic Scholar

    Save