The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Arist Kojevnikov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Edward A. Hirsch, Arist Kojevnikov
    Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination. [Citation Graph (0, 0)][DBLP]
    CP, 2001, pp:605-609 [Conf]
  2. Arist Kojevnikov, Dmitry Itsykson
    Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:323-334 [Conf]
  3. Arist Kojevnikov, Alexander S. Kulikov
    Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:11-21 [Conf]
  4. Arist Kojevnikov, Alexander S. Kulikov
    A new approach to proving upper bounds for MAX-2-SAT. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:11-17 [Conf]
  5. 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:91-111 [Journal]
  6. Edward A. Hirsch, Arist Kojevnikov
    Several notes on the power of Gomory-Chvátal cuts. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:141, n:3, pp:429-436 [Journal]
  7. Edward A. Hirsch, Arist Kojevnikov
    Several notes on the power of Gomory-Chvatal cuts [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:012, pp:- [Journal]
  8. Arist Kojevnikov
    Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:70-79 [Conf]

  9. Circuit Complexity and Multiplicative Complexity of Boolean Functions. [Citation Graph (, )][DBLP]


  10. Finding Efficient Circuits Using SAT-Solvers. [Citation Graph (, )][DBLP]


  11. New Combinatorial Complete One-Way Functions. [Citation Graph (, )][DBLP]


  12. New Combinatorial Complete One-Way Functions [Citation Graph (, )][DBLP]


  13. Improved Lower Bounds for Resolution over Linear Inequalities. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002