Arist Kojevnikov, Alexander S. Kulikov, Circuit Complexity and Multiplicative Complexity of Boolean Functions, Proceedings of Computability in Europe (CiE 2010), pp. 239-245.
Jack Demenkov, Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev, New upper bounds on the Boolean Circuit Complexity of Symmetric Functions, Information Processing Letters, 110 (2010), pp. 264-267.
Arist Kojevnikov, Alexander S. Kulikov and Grigory Yaroslavtsev, Finding Efficient Circuits Using SAT-solvers, in Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing (SAT 2009), pp. 32-44.
Arist Kojevnikov, Alexander S. Kulikov and Grigory Yaroslavtsev, Circuit Complexity of MOD-functions, PDMI preprint 18/2008, Steklov Institute of Mathematics at St.Petersburg.
Edward A. Hirsch, Arist Kojevnikov,
Alexander S. Kulikov and
Sergey I. Nikolenko,
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity,
Journal on Satisfiability, Boolean Modeling and Computation, Volume 6 (2008), pp. 53-69.
Preliminary version appeared as
Arist Kojevnikov and
Alexander S. Kulikov,
Complexity
of Semialgebraic Proofs with Restricted Degree of Falsity,
in Proceedings of the 9th International Conference on
Theory and Applications of Satisfiability Testing (SAT 2006), pp. 11-21.
Dima Grigoriev,
Arist Kojevnikov and
Sergey I. Nikolenko,
Algebraic Cryptography: New Constructions and Their Security Against
Provable Worst-Case Break, Algebra and Analysis
6:119-147, 2008 (in Russian).
Preliminary version appeared as
Dima Grigoriev,
Arist Kojevnikov and
Sergey I. Nikolenko,
Invariant-Based Cryptosystems and Their Security Against
Provable Worst-Case Break.
Max-Planck-Institut fur Mathematik Preprint no. 158, 2007.
Arist Kojevnikov, Ivan Monakhov and Sergey K. Naumov, Distributional Word Problem for Tseitin Semigroup, unpublished manuscript, last update 13.02.2008.
Arist Kojevnikov and Sergey I. Nikolenko, New Combinatorial Complete One-Way Functions, in Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2008), pp. 457-466.
Arist Kojevnikov and Alexander S. Kulikov, Lower Bounds on Formula Size of Error-Correcting Codes, the result was proved (by more simple method) in K. L. Rychkov, A modification of Khrapchenko's method and its applications to bounds on the complexity of Pi-schemes and coding functions. 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.
Arist Kojevnikov,
Improved Lower Bounds for tree-like Resolution over Linear Inequalities,
in Proceedings of the 10th International Conference on
Theory and Applications of Satisfiability Testing (SAT 2007), pp. 70-79.
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,
Lower bounds of static Lovasz-Schrijver calculus proofs for Tseitin tautologies
,
Zapiski Nauchnyh Seminarov POMI, 340:10-32, 2006 (in Russian).
English translation.
Preliminary version
appeared as
Exponential Lower Bound on the Size
of Static Lovasz-Schrijver Calculus,
in Proceedings of the 33rd International Colloquium on
Automata, Languages and Programming (ICALP 2006), pp. 323-334.
Edward A. Hirsch
and Arist Kojevnikov,
Several
notes on the power of Gomory-Chvátal cuts,
Annals of Pure and Applied Logic, 141(3):429-436, 2006.
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, A New Approach for Proving Upper Bounds for MAX-2-SAT, in Proceeding of the Symposium on Discrete Algorithms (SODA 2006), pp. 11-17.
Edward A. Hirsch, Dmitry Itsykson, Arist Kojevnikov, Alexander S. Kulikov and Sergey I. Nikolenko, Report on the Mixed Boolean-Algebraic Solver, Unpublished manuscript, 2005.
Edward A. Hirsch and
Arist Kojevnikov, UnitWalk: A new SAT solver that uses local
search guided by unit clause elimination,
Annals of Mathematics and Artificial Intelligence 43(1-4):91-111, 2005.
Preliminary version appeared in the
electronic proceedings of
SAT-2002.
Grigori Mints
and Arist Kojevnikov,
Intuitionistic Frege systems are polynomially equivalent,
Journal of Mathematical Sciences, 134(5):2392-2402, 2006.
Reprinted from
Grigori Mints
and Arist Kojevnikov,
Intuitionistic Frege systems are polynomially equivalent,
Zapiski Nauchnyh Seminarov POMI, 316:129-146, 2004.
Sergey S. Fedin, Arist Kojevnikov, Boris Konev, Alexander S. Kulikov, Sergey I. Nikolenko and Vladimir Orevkov, First report on the semialgebraic prover, PDMI preprint 09/2004, Steklov Institute of Mathematics at St.Petersburg.
Edward A. Hirsch and Arist Kojevnikov, Solving Boolean satisfiability using local search guided by unit clause elimination, in Proceeding of the 7th International Conference on Principles and Practice of Constraint Programming (CP'01), pp. 605 - 609, 2001.