2008 | ||
---|---|---|
11 | EE | Arist Kojevnikov, Sergey I. Nikolenko: New Combinatorial Complete One-Way Functions. STACS 2008: 457-466 |
10 | EE | Arist Kojevnikov, Sergey I. Nikolenko: New Combinatorial Complete One-Way Functions CoRR abs/0802.2863: (2008) |
2007 | ||
9 | EE | Arist Kojevnikov: Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities. SAT 2007: 70-79 |
8 | EE | Arist Kojevnikov: Improved Lower Bounds for Resolution over Linear Inequalities. Electronic Colloquium on Computational Complexity (ECCC) 14(010): (2007) |
2006 | ||
7 | EE | Arist Kojevnikov, Dmitry Itsykson: Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies. ICALP (1) 2006: 323-334 |
6 | EE | Arist Kojevnikov, Alexander S. Kulikov: Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. SAT 2006: 11-21 |
5 | EE | Arist Kojevnikov, Alexander S. Kulikov: A new approach to proving upper bounds for MAX-2-SAT. SODA 2006: 11-17 |
4 | EE | Edward A. Hirsch, Arist Kojevnikov: Several notes on the power of Gomory-Chvátal cuts. Ann. Pure Appl. Logic 141(3): 429-436 (2006) |
2005 | ||
3 | EE | Edward 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 | ||
2 | EE | Edward A. Hirsch, Arist Kojevnikov: Several notes on the power of Gomory-Chvatal cuts Electronic Colloquium on Computational Complexity (ECCC) 10(012): (2003) |
2001 | ||
1 | EE | Edward A. Hirsch, Arist Kojevnikov: Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination. CP 2001: 605-609 |
1 | Edward A. Hirsch | [1] [2] [3] [4] |
2 | Dmitry Itsykson | [7] |
3 | Alexander S. Kulikov | [5] [6] |
4 | Sergey I. Nikolenko | [10] [11] |