Follow
Evgeny Dantsin
Evgeny Dantsin
Professor of Computer Science, Roosevelt University
Verified email at roosevelt.edu - Homepage
Title
Cited by
Cited by
Year
Complexity and expressive power of logic programming
E Dantsin, T Eiter, G Gottlob, A Voronkov
ACM Computing Surveys (CSUR) 33 (3), 374-425, 2001
9472001
A deterministic (2− 2/(k+ 1)) n algorithm for k-SAT based on local search
E Dantsin, A Goerdt, EA Hirsch, R Kannan, J Kleinberg, C Papadimitriou, ...
Theoretical Computer Science 289 (1), 69-83, 2002
2702002
Complexity and expressive power of logic programming
E Dantsin, T Eiter, G Gottlob, A Voronkov
Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, 82-101, 1997
1401997
Worst-Case Upper Bounds.
E Dantsin, EA Hirsch
Handbook of Satisfiability 185 (403-424), 9, 2009
722009
Probabilistic logic programs and their semantics
E Dantsin
Logic Programming: First Russian Conference on Logic Programming Irkutsk …, 2005
662005
Algorithms for SAT and upper bounds on their complexity
E Dantsin, EA Hirsch, S Ivanov, M Vsemirnov
Electronic Colloquium on Computational Complexity, Report, 2001
50*2001
Deterministic algorithms for k-SAT based on covering codes and local search
E Dantsin, A Goerdt, EA Hirsch, U Schöning
International Colloquium on Automata, Languages, and Programming, 236-247, 2000
502000
Algorithms for SAT based on search in Hamming balls
E Dantsin, EA Hirsch, A Wolpert
Annual Symposium on Theoretical Aspects of Computer Science, 141-151, 2004
372004
MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in Time
E Dantsin, A Wolpert
International Conference on Theory and Applications of Satisfiability …, 2006
352006
Complexity of query answering in logic databases with complex values
E Dantsin, A Voronkov
Logical Foundations of Computer Science: 4th International Symposium, LFCS …, 1997
311997
Population variance under interval uncertainty: a new algorithm
E Dantsin, V Kreinovich, A Wolpert, G Xiang
Reliable Computing 12 (4), 273-280, 2006
292006
MAX SAT approximation beyond the limits of polynomial-time approximation
E Dantsin, M Gavrilovich, EA Hirsch, B Konev
Annals of Pure and Applied Logic 113 (1-3), 81-94, 2001
282001
An improved upper bound for SAT
E Dantsin, A Wolpert
Theory and Applications of Satisfiability Testing: 8th International …, 2005
262005
Derandomization of Schuler’s algorithm for SAT
E Dantsin, A Wolpert
International Conference on Theory and Applications of Satisfiability …, 2004
262004
Two propositional proof systems based on the splitting method
E Dantsin
Zapiski Nauchnykh Seminarov LOMI 105, 24-44, 1981
25*1981
Approximation algorithms for Max SAT: A better performance ratio at the cost of a longer running time
E Dantsin, M Gavrilovich, EA Hirsch, B Konev
Submitted for publication, 1998
221998
On moderately exponential time for SAT
E Dantsin, A Wolpert
International Conference on Theory and Applications of Satisfiability …, 2010
212010
Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms
E Dantsin, EA Hirsch, A Wolpert
Italian Conference on Algorithms and Complexity, 60-68, 2006
202006
A nondeterministic polynomial-time unification algorithm for bags, sets and trees
E Dantsin, A Voronkov
International conference on foundations of software science and computation …, 1999
201999
On quantum versions of record-breaking algorithms for SAT
E Dantsin, V Kreinovich, A Wolpert
ACM SIGACT News 36 (4), 103-108, 2005
192005
The system can't perform the operation now. Try again later.
Articles 1–20