Follow
Arist Kojevnikov
Arist Kojevnikov
Senior Development Engineer, OneSpin Solutions GmbH
Verified email at logic.pdmi.ras.ru - Homepage
Title
Cited by
Cited by
Year
UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
EA Hirsch, A Kojevnikov
Annals of Mathematics and Artificial Intelligence 43, 91-111, 2005
1682005
Finding efficient circuits using SAT-solvers
A Kojevnikov, AS Kulikov, G Yaroslavtsev
International Conference on Theory and Applications of Satisfiability …, 2009
562009
A new approach to proving upper bounds for MAX-2-SAT
A Kojevnikov, AS Kulikov
SODA 6, 11-17, 2006
562006
New upper bounds on the Boolean circuit complexity of symmetric functions
E Demenkov, A Kojevnikov, A Kulikov, G Yaroslavtsev
Information Processing Letters 110 (7), 264-267, 2010
462010
Solving Boolean satisfiability using local search guided by unit clause elimination
EA Hirsch, A Kojevnikov
Principles and Practice of Constraint Programming—CP 2001: 7th …, 2001
262001
Circuit complexity and multiplicative complexity of Boolean functions
A Kojevnikov, AS Kulikov
Conference on Computability in Europe, 239-245, 2010
222010
Lower bounds of static Lovasz-Schrijver calculus proofs for Tseitin tautologies
A Kojevnikov, D Itsykson
Automata, Languages and Programming: 33rd International Colloquium, ICALP …, 2006
222006
Intuitionistic Frege systems are polynomially equivalent
G Mints, AA Kojevnikov
Записки научных семинаров ПОМИ 316 (0), 129-146, 2004
172004
Improved lower bounds for tree-like resolution over linear inequalities
A Kojevnikov
International Conference on Theory and Applications of Satisfiability …, 2007
132007
Report on the mixed boolean-algebraic solver
E Hirsch, D Itsykson, A Kojevnikov, A Kulikov, S Nikolenko
Technical report, Laboratory of Mathematical Logic of St. Petersburg …, 2005
112005
New combinatorial complete one-way functions
A Kojevnikov, SI Nikolenko
arXiv preprint arXiv:0802.2863, 2008
102008
Lower bounds of static Lovász-Schrijver calculus proofs for Tseitin tautologies
D Itsykson, A Kojevnikov
Zapiski Nauchnyh Seminarov POMI 340, 10-32, 2006
102006
Several notes on the power of Gomory–Chvátal cuts
EA Hirsch, A Kojevnikov
Annals of Pure and Applied Logic 141 (3), 429-436, 2006
92006
Algebraic cryptography: New constructions and their security against provable break
D Grigoriev, A Kojevnikov, S Nikolenko
St. Petersburg Mathematical Journal 20 (6), 937-953, 2009
72009
Invariant based cryptosystems and their security against provable worst-case break
D Grigoriev, A Kojevnikov, S Nikolenko
62007
On complete one-way functions
AA Kojevnikov, SI Nikolenko
Problemy Peredachi Informatsii 45 (2), 101-118, 2009
52009
Lower bounds on static Lovász-Schrijver calculus proofs for Tseitin tautologies
DM Itsykson, AA Kojevnikov
Journal of Mathematical Sciences 145, 4942-4952, 2007
42007
Complexity of semialgebraic proofs with restricted degree of falsity
EA Hirsch, A Kojevnikov, AS Kulikov, SI Nikolenko
Journal on Satisfiability, Boolean Modeling and Computation 6 (1-3), 53-69, 2010
32010
Complexity of semialgebraic proofs with restricted degree of falsity
A Kojevnikov, AS Kulikov
International Conference on Theory and Applications of Satisfiability …, 2006
22006
Intuitionistic Frege systems are polynomially equivalent
G Mints, A Kojevnikov
Journal of Mathematical Sciences 134, 2392-2402, 2006
22006
The system can't perform the operation now. Try again later.
Articles 1–20