Arist Kojevnikov

According to our database, Arist Kojevnikov authored at least 13 papers between 2001 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2010

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

Evgeny Demenkov, Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev

Inf. Process. Lett., 2010

Circuit Complexity and Multiplicative Complexity of Boolean Functions.

Arist Kojevnikov, Alexander S. Kulikov

Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009

Complexity of Semialgebraic Proofs with Restricted Degree of Falsity.

Edward A. Hirsch, Arist Kojevnikov, Alexander S. Kulikov, Sergey I. Nikolenko

J. Satisf. Boolean Model. Comput., 2009

Finding Efficient Circuits Using SAT-Solvers.

Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008

New Combinatorial Complete One-Way Functions.

Arist Kojevnikov, Sergey I. Nikolenko

Proceedings of the STACS 2008, 2008

2007

Improved Lower Bounds for Resolution over Linear Inequalities.

Arist Kojevnikov

Electron. Colloquium Comput. Complex., 2007

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

Arist Kojevnikov

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

2006

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

Arist Kojevnikov, Alexander S. Kulikov

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Complexity of Semialgebraic Proofs with Restricted Degree of Falsity.

Arist Kojevnikov, Alexander S. Kulikov

Proceedings of the Theory and Applications of Satisfiability Testing, 2006

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

Arist Kojevnikov, Dmitry Itsykson

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

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

Edward A. Hirsch, Arist Kojevnikov

Ann. Math. Artif. Intell., 2005

2003

Several notes on the power of Gomory-Chvatal cuts

Edward A. Hirsch, Arist Kojevnikov

Electron. Colloquium Comput. Complex., 2003

2001

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

Edward A. Hirsch, Arist Kojevnikov

Proceedings of the Principles and Practice of Constraint Programming, 2001