Arist Kojevnikov, Alexander S. Kulikov,

, Proceedings of Computability in Europe (CiE 2010), pp. 239-245.**Circuit Complexity and Multiplicative Complexity of Boolean Functions**Jack Demenkov, Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev,

, Information Processing Letters, 110 (2010), pp. 264-267.**New upper bounds on the Boolean Circuit Complexity of Symmetric Functions**Arist Kojevnikov, Alexander S. Kulikov and Grigory Yaroslavtsev,

, in Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing (SAT 2009), pp. 32-44.**Finding Efficient Circuits Using SAT-solvers**Arist Kojevnikov, Alexander S. Kulikov and Grigory Yaroslavtsev,

, PDMI preprint 18/2008, Steklov Institute of Mathematics at St.Petersburg.**Circuit Complexity of MOD-functions**Edward A. Hirsch, Arist Kojevnikov, Alexander S. Kulikov and Sergey I. Nikolenko,

, Journal on Satisfiability, Boolean Modeling and Computation, Volume 6 (2008), pp. 53-69.**Complexity of Semialgebraic Proofs with Restricted Degree of Falsity**

Preliminary version appeared as

Arist Kojevnikov and Alexander S. Kulikov,, in Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing (SAT 2006), pp. 11-21.**Complexity of Semialgebraic Proofs with Restricted Degree of Falsity**Dima Grigoriev, Arist Kojevnikov and Sergey I. Nikolenko,

, Algebra and Analysis 6:119-147, 2008 (in Russian).**Algebraic Cryptography: New Constructions and Their Security Against Provable Worst-Case Break**

Preliminary version appeared as

Dima Grigoriev, Arist Kojevnikov and Sergey I. Nikolenko,. Max-Planck-Institut fur Mathematik Preprint no. 158, 2007.**Invariant-Based Cryptosystems and Their Security Against Provable Worst-Case Break**Arist Kojevnikov, Ivan Monakhov and Sergey K. Naumov,

, unpublished manuscript, last update 13.02.2008.**Distributional Word Problem for Tseitin Semigroup**Arist Kojevnikov and Sergey I. Nikolenko,

, in Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2008), pp. 457-466.**New Combinatorial Complete One-Way Functions**Arist Kojevnikov and Alexander S. Kulikov,

, the result was proved (by more simple method) in K. L. Rychkov,**Lower Bounds on Formula Size of Error-Correcting Codes**. Metody Diskretnogo Analiza v theorii graphov i skhem. 42:91-98, 1985 (in Russian). However, you may still want to read our draft to get the details of the proof (if, for example, you do not know Russian). Unpublished manuscript, last update 2.10.2007.**A modification of Khrapchenko's method and its applications to bounds on the complexity of Pi-schemes and coding functions**Arist Kojevnikov,

, in Proceedings of the 10th International Conference on Theory and Applications of Satisfiability Testing (SAT 2007), pp. 70-79.**Improved Lower Bounds for tree-like Resolution over Linear Inequalities**

Preliminary version appeared as ECCC Report TR07-010, Revision 01, that is the**corrected**version of ECCC Report TR07-010.Dmitry Itsykson and Arist Kojevnikov,

, Zapiski Nauchnyh Seminarov POMI, 340:10-32, 2006 (in Russian). English translation.**Lower bounds of static Lovasz-Schrijver calculus proofs for Tseitin tautologies**

Preliminary version appeared as, in Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006), pp. 323-334.**Exponential Lower Bound on the Size of Static Lovasz-Schrijver Calculus**Edward A. Hirsch and Arist Kojevnikov,

, Annals of Pure and Applied Logic, 141(3):429-436, 2006.**Several notes on the power of Gomory-Chvátal cuts**

Preliminary version appeared as ECCC Report TR03-012 and was presented at Second St.Petersburg Days of logic and computability.Arist Kojevnikov and Alexander S. Kulikov,

, in Proceeding of the Symposium on Discrete Algorithms (SODA 2006), pp. 11-17.**A New Approach for Proving Upper Bounds for MAX-2-SAT**Edward A. Hirsch, Dmitry Itsykson, Arist Kojevnikov, Alexander S. Kulikov and Sergey I. Nikolenko,

, Unpublished manuscript, 2005.**Report on the Mixed Boolean-Algebraic Solver**Edward A. Hirsch and Arist Kojevnikov,

, Annals of Mathematics and Artificial Intelligence 43(1-4):91-111, 2005.**UnitWalk: A new SAT solver that uses local search guided by unit clause elimination**

Preliminary version appeared in the electronic proceedings of SAT-2002.Grigori Mints and Arist Kojevnikov,

, Journal of Mathematical Sciences, 134(5):2392-2402, 2006.**Intuitionistic Frege systems are polynomially equivalent**

Reprinted from Grigori Mints and Arist Kojevnikov,, Zapiski Nauchnyh Seminarov POMI, 316:129-146, 2004.**Intuitionistic Frege systems are polynomially equivalent**Sergey S. Fedin, Arist Kojevnikov, Boris Konev, Alexander S. Kulikov, Sergey I. Nikolenko and Vladimir Orevkov,

, PDMI preprint 09/2004, Steklov Institute of Mathematics at St.Petersburg.**First report on the semialgebraic prover**Edward A. Hirsch and Arist Kojevnikov,

, in Proceeding of the 7th International Conference on Principles and Practice of Constraint Programming (CP'01), pp. 605 - 609, 2001.**Solving Boolean satisfiability using local search guided by unit clause elimination**