
Search the dblp DataBase
Arist Kojevnikov:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Edward A. Hirsch, Arist Kojevnikov
Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination. [Citation Graph (0, 0)][DBLP] CP, 2001, pp:605609 [Conf]
 Arist Kojevnikov, Dmitry Itsykson
Lower Bounds of Static LovászSchrijver Calculus Proofs for Tseitin Tautologies. [Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:323334 [Conf]
 Arist Kojevnikov, Alexander S. Kulikov
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. [Citation Graph (0, 0)][DBLP] SAT, 2006, pp:1121 [Conf]
 Arist Kojevnikov, Alexander S. Kulikov
A new approach to proving upper bounds for MAX2SAT. [Citation Graph (0, 0)][DBLP] SODA, 2006, pp:1117 [Conf]
 Edward A. Hirsch, Arist Kojevnikov
UnitWalk: A new SAT solver that uses local search guided by unit clause elimination. [Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:91111 [Journal]
 Edward A. Hirsch, Arist Kojevnikov
Several notes on the power of GomoryChvátal cuts. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 2006, v:141, n:3, pp:429436 [Journal]
 Edward A. Hirsch, Arist Kojevnikov
Several notes on the power of GomoryChvatal cuts [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:012, pp: [Journal]
 Arist Kojevnikov
Improved Lower Bounds for TreeLike Resolution over Linear Inequalities. [Citation Graph (0, 0)][DBLP] SAT, 2007, pp:7079 [Conf]
Circuit Complexity and Multiplicative Complexity of Boolean Functions. [Citation Graph (, )][DBLP]
Finding Efficient Circuits Using SATSolvers. [Citation Graph (, )][DBLP]
New Combinatorial Complete OneWay Functions. [Citation Graph (, )][DBLP]
New Combinatorial Complete OneWay Functions [Citation Graph (, )][DBLP]
Improved Lower Bounds for Resolution over Linear Inequalities. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
