Evgeny Dantsin

Publication Activity (10 Years)

Years Active: 1988-2023
Publications (10 Years): 5

Top Topics

Boolean Formula

Conjunctive Normal Form

Top Venues

J. Satisf. Boolean Model. Comput.

Publications

Evgeny Dantsin, Alexander Wolpert
An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF. J. Satisf. Boolean Model. Comput. 14 (1) (2023)
Evgeny Dantsin, Vladik Kreinovich, Alexander Wolpert
An AlphaZero-Inspired Approach to Solving Search Problems. CoRR (2022)
Evgeny Dantsin, Alexander Wolpert
Similarity Between Points in Metric Measure Spaces. SISAP (2020)
Evgeny Dantsin, Alexander Wolpert
Similarity Between Points in Metric Measure Spaces. CoRR (2020)
Evgeny Dantsin, Alexander Wolpert
Reconstruction of Boolean Formulas in Conjunctive Normal Form. COCOON (2018)
Evgeny Dantsin, Alexander Wolpert
Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas. CIAC (2013)
Evgeny Dantsin, Edward A. Hirsch
Satisfiability Certificates Verifiable in Subexponential Time. SAT (2011)
Evgeny Dantsin, Alexander Wolpert
On Moderately Exponential Time for SAT. SAT (2010)
Evgeny Dantsin, Alexander Wolpert
A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length. J. Satisf. Boolean Model. Comput. 1 (1) (2006)
Evgeny Dantsin, Alexander Wolpert, Vladik Kreinovich
Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems. SAC (2006)
Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. CIAC (2006)
Evgeny Dantsin, Alexander Wolpert
) Time. SAT (2006)
Evgeny Dantsin, Vladik Kreinovich, Alexander Wolpert, Gang Xiang
Population Variance under Interval Uncertainty: A New Algorithm. Reliab. Comput. 12 (4) (2006)
Evgeny Dantsin, Alexander Wolpert
An Improved Upper Bound for SAT Electron. Colloquium Comput. Complex. (030) (2005)
Evgeny Dantsin, Vladik Kreinovich, Alexander Wolpert
On quantum versions of record-breaking algorithms for SAT. SIGACT News 36 (4) (2005)
Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms Electron. Colloquium Comput. Complex. (102) (2005)
Evgeny Dantsin, Alexander Wolpert
An Improved Upper Bound for SAT. SAT (2005)
Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
Algorithms for SAT Based on Search in Hamming Balls. STACS (2004)
Evgeny Dantsin, Alexander Wolpert
Derandomization of Schuler's Algorithm for SAT. SAT (Selected Papers (2004)
Evgeny Dantsin, Alexander Wolpert
Derandomization of Schuler's Algorithm for SAT Electron. Colloquium Comput. Complex. (017) (2004)
Evgeny Dantsin, Alexander Wolpert
Derandomization of Schuler's Algorithm for SAT. SAT (2004)
Evgeny Dantsin, Alexander Wolpert
A Robust Dna Computation Model That Captures Pspace. Int. J. Found. Comput. Sci. 14 (5) (2003)
Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
Algorithms for SAT based on search in Hamming balls Electron. Colloquium Comput. Complex. (072) (2003)
Evgeny Dantsin, Alexander Wolpert
Solving Constraint Satisfaction Problems with DNA Computing. COCOON (2002)
Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning
algorithm for k-SAT based on local search. Theor. Comput. Sci. 289 (1) (2002)
Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov
Complexity and expressive power of logic programming. ACM Comput. Surv. 33 (3) (2001)
Evgeny Dantsin, Michael Gavrilovich, Edward A. Hirsch, Boris Konev
MAX SAT approximation beyond the limits of polynomial-time approximation. Ann. Pure Appl. Log. 113 (1-3) (2001)
Evgeny Dantsin, Edward A. Hirsch, Sergei Ivanov, Maxim Vsemirnov
Algorithms for SAT and Upper Bounds on Their Complexity Electron. Colloquium Comput. Complex. 8 (12) (2001)
Evgeny Dantsin, Andrei Voronkov
Expressive Power and Data Complexity of Query Languages for Trees and Lists. PODS (2000)
Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning
-SAT Based on Covering Codes and Local Search. ICALP (2000)
Evgeny Dantsin, Andrei Voronkov
A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees. FoSSaCS (1999)
Evgeny Dantsin, Andrei Voronkov
Complexity of Query Answering in Logic Databases with Complex Values. LFCS (1997)
Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov
Complexity and Expressive Power of Logic Programming. Computational Complexity Conference (1997)
Evgeny Dantsin
Probabilistic Logic Programs and their Semantics. RCLP (1991)
Evgeny Dantsin
Algorithms for Probabilistic Inference. Conference on Computer Logic (1988)