dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Arist Kojevnikov Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2010
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArist Kojevnikov, Alexander S. Kulikov: Circuit Complexity and Multiplicative Complexity of Boolean Functions. CiE 2010: 239-245
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEvgeny Demenkov, Arist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev: New upper bounds on the Boolean circuit complexity of symmetric functions. Inf. Process. Lett. 110(7): 264-267 (2010)
2009
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev: Finding Efficient Circuits Using SAT-Solvers. SAT 2009: 32-44
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdward A. Hirsch, Arist Kojevnikov, Alexander S. Kulikov, Sergey I. Nikolenko: Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. JSAT 6(1-3): 53-69 (2009)
2008
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArist Kojevnikov, Sergey I. Nikolenko: New Combinatorial Complete One-Way Functions. STACS 2008: 457-466
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArist Kojevnikov, Sergey I. Nikolenko: New Combinatorial Complete One-Way Functions CoRR abs/0802.2863: (2008)
2007
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArist Kojevnikov: Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities. SAT 2007: 70-79
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArist Kojevnikov: Improved Lower Bounds for Resolution over Linear Inequalities. Electronic Colloquium on Computational Complexity (ECCC) 14(010): (2007)
2006
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArist Kojevnikov, Dmitry Itsykson: Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies. ICALP (1) 2006: 323-334
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArist Kojevnikov, Alexander S. Kulikov: Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. SAT 2006: 11-21
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArist Kojevnikov, Alexander S. Kulikov: A new approach to proving upper bounds for MAX-2-SAT. SODA 2006: 11-17
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdward A. Hirsch, Arist Kojevnikov: Several notes on the power of Gomory-Chvátal cuts. Ann. Pure Appl. Logic 141(3): 429-436 (2006)
2005
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdward A. Hirsch, Arist Kojevnikov: UnitWalk: A new SAT solver that uses local search guided by unit clause elimination. Ann. Math. Artif. Intell. 43(1): 91-111 (2005)
2003
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdward A. Hirsch, Arist Kojevnikov: Several notes on the power of Gomory-Chvatal cuts Electronic Colloquium on Computational Complexity (ECCC) 10(012): (2003)
2001
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdward A. Hirsch, Arist Kojevnikov: Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination. CP 2001: 605-609

Coauthor Index

1Evgeny Demenkov [14]
2Edward A. Hirsch [1] [2] [3] [4] [12]
3Dmitry Itsykson [7]
4Alexander S. Kulikov [5] [6] [12] [13] [14] [15]
5Sergey I. Nikolenko [10] [11] [12]
6Grigory Yaroslavtsev [13] [14]

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page