Arist Kojevnikov
Arist Kojevnikov
Senior Development Engineer, OneSpin Solutions GmbH
Подтвержден адрес электронной почты в домене logic.pdmi.ras.ru - Главная страница
Название
Процитировано
Процитировано
Год
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 (1), 91-111, 2005
1592005
A new approach to proving upper bounds for MAX-2-SAT
A Kojevnikov, AS Kulikov
SODA 6, 11-17, 2006
542006
Finding efficient circuits using SAT-solvers
A Kojevnikov, AS Kulikov, G Yaroslavtsev
International Conference on Theory and Applications of Satisfiability …, 2009
482009
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
392010
Solving Boolean satisfiability using local search guided by unit clause elimination
EA Hirsch, A Kojevnikov
International Conference on Principles and Practice of Constraint …, 2001
232001
Lower bounds of static Lovasz-Schrijver calculus proofs for Tseitin tautologies
A Kojevnikov, D Itsykson
International Colloquium on Automata, Languages, and Programming, 323-334, 2006
212006
Circuit complexity and multiplicative complexity of Boolean functions
A Kojevnikov, AS Kulikov
Conference on Computability in Europe, 239-245, 2010
192010
Intuitionistic Frege systems are polynomially equivalent
G Mints, A Kojevnikov
Journal of Mathematical Sciences 134 (5), 2392-2402, 2006
172006
Improved lower bounds for tree-like resolution over linear inequalities
A Kojevnikov
International Conference on Theory and Applications of Satisfiability …, 2007
102007
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
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
102005
New combinatorial complete one-way functions
A Kojevnikov, SI Nikolenko
arXiv preprint arXiv:0802.2863, 2008
92008
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
62009
Invariant-based cryptosystems and their security against provable worst-case break
D Grigoriev, A Kojevnikov, S Nikolenko
MPI, 2007
62007
On complete one-way functions
AA Kojevnikov, SI Nikolenko
Problemy Peredachi Informatsii 45 (2), 101-118, 2009
52009
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
Lower bounds on static Lovász-Schrijver calculus proofs for Tseitin tautologies
DM Itsykson, AA Kojevnikov
Journal of Mathematical Sciences 145 (3), 4942-4952, 2007
32007
Complexity of semialgebraic proofs with restricted degree of falsity
A Kojevnikov, AS Kulikov
International Conference on Theory and Applications of Satisfiability …, 2006
22006
Lower bounds on formula size of error-correcting codes
A Kojevnikov, AS Kulikov
12007
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20