Arist Kojevnikov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Arist Kojevnikov has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Alexander S. Kulikov
Research JetBrains
2 shared publications - Edward A. Hirsch
Steklov Institute of Mathematics at St.Petersburg
2 shared publications - E. Demenkov
St. Petersburg State University, Russian Federation
1 shared publication Edward A. Hirsch
Steklov Institute of Mathematics at St. Petersburg, 27 Fontanka, 191023 St. Petersburg, Russia. s
1 shared publication- G. Yaroslavtsev
Academic University, Russian Federation
1 shared publication - Grigori Mints
Stanford University
1 shared publication
Latest Publications
- 1 March 2010
- Published by Elsevier in Information Processing Letters
- Vol. 110 (7) , 264-267
New upper bounds on the Boolean circuit complexity of symmetric functions
- 1 March 2010
- Published by Elsevier in Information Processing Letters
- Vol. 110 (7) , 264-267
New upper bounds on the Boolean circuit complexity of symmetric functions
- Open Access
- 1 November 2008
- Published by SAGE Publications in Journal on Satisfiability, Boolean Modeling and Computation
- Vol. 6 (1-3) , 53-69
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity12
The degree of falsity of an inequality in Boolean variables shows how many variables are enough to substitute in order to satisfy the inequality. Goerdt introduced a weakened version of the Cutting Plane (CP) proof system with a restriction on the de
- 1 November 2008
- Published by SAGE Publications in Journal on Satisfiability, Boolean Modeling and Computation
- Vol. 6 (1-3) , 53-69
Open AccessComplexity of Semialgebraic Proofs with Restricted Degree of Falsity12
The degree of falsity of an inequality in Boolean variables shows how many variables are enough to substitute in order to satisfy the inequality. Goerdt introduced a weakened version of the Cutting Plane (CP) proof system with a restriction on the de
- 30 September 2006
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 141 (3) , 429-436
Several notes on the power of Gomory–Chvátal cuts
- 30 September 2006
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 141 (3) , 429-436
Several notes on the power of Gomory–Chvátal cuts
- 1 May 2006
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 134 (5) , 2392-2402
Intuitionistic Frege systems are polynomially equivalent
- 1 May 2006
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 134 (5) , 2392-2402
Intuitionistic Frege systems are polynomially equivalent
- 1 January 2005
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 43 (1-4) , 91-111
UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination
- 1 January 2005
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 43 (1-4) , 91-111
UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination