Evgeny Dantsin - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 36 from 36

2023

An Isomorphism-Invariant Distance Function on Propositional Formulas in CNFEvgeny Dantsin, Alexander Wolpert. jsat, 14(1):1-15, 2023. [doi]

An AlphaZero-Inspired Approach to Solving Search ProblemsEvgeny Dantsin, Vladik Kreinovich, Alexander Wolpert. In Martine Ceberio, Vladik Kreinovich, editors, Decision Making Under Uncertainty and Constraints - A Why-Book. Volume 217 of pages 129-138, Springer, 2023. [doi]

2021

Worst-Case Upper BoundsEvgeny Dantsin, Edward A. Hirsch. In Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh, editors, Handbook of Satisfiability - Second Edition. Volume 336 of Frontiers in Artificial Intelligence and Applications, pages 669-692, IOS Press, 2021. [doi]

2020

Similarity Between Points in Metric Measure SpacesEvgeny Dantsin, Alexander Wolpert. sisap 2020: 177-184 [doi]

2018

Reconstruction of Boolean Formulas in Conjunctive Normal FormEvgeny Dantsin, Alexander Wolpert. cocoon 2018: 592-601 [doi]

2013

Exponential Complexity of Satisfiability Testing for Linear-Size Boolean FormulasEvgeny Dantsin, Alexander Wolpert. ciac 2013: 110-121 [doi]

2011

Satisfiability Certificates Verifiable in Subexponential TimeEvgeny Dantsin, Edward A. Hirsch. sat 2011: 19-32 [doi]

2010

On Moderately Exponential Time for SATEvgeny Dantsin, Alexander Wolpert. sat 2010: 313-325 [doi]

2009

Worst-Case Upper BoundsEvgeny Dantsin, Edward A. Hirsch. In Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh, editors, Handbook of Satisfiability. Volume 185 of Frontiers in Artificial Intelligence and Applications, pages 403-424, IOS Press, 2009. [doi]

2006

A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause LengthEvgeny Dantsin, Alexander Wolpert. jsat, 1(1):49-60, 2006. [doi]

MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s:::2:::) TimeEvgeny Dantsin, Alexander Wolpert. sat 2006: 266-276 [doi]

Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT AlgorithmsEvgeny Dantsin, Edward A. Hirsch, Alexander Wolpert. ciac 2006: 60-68 [doi]

Population Variance under Interval Uncertainty: A New AlgorithmEvgeny Dantsin, Vladik Kreinovich, Alexander Wolpert, Gang Xiang. rc, 12(4):273-280, 2006. [doi]

Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problemsEvgeny Dantsin, Alexander Wolpert, Vladik Kreinovich. SAC 2006: 1640-1644 [doi]

2005

2004

2003

A Robust Dna Computation Model That Captures PspaceEvgeny Dantsin, Alexander Wolpert. ijfcs, 14(5):933, 2003. [doi]

Algorithms for SAT based on search in Hamming ballsEvgeny Dantsin, Edward A. Hirsch, Alexander Wolpert. eccc, (072), 2003. [doi]

2002

Solving Constraint Satisfaction Problems with DNA ComputingEvgeny Dantsin, Alexander Wolpert. cocoon 2002: 171-180 [doi]

A deterministic (2-2/(k+1)):::n::: algorithm for k-SAT based on local searchEvgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning. TCS, 289(1):69-83, 2002.

2001

2000

Expressive Power and Data Complexity of Query Languages for Trees and ListsEvgeny Dantsin, Andrei Voronkov. PODS 2000: 157-165 [doi]

Deterministic Algorithms for ::::k::::-SAT Based on Covering Codes and Local SearchEvgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning. icalp 2000: 236-247 [doi]

1999

A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and TreesEvgeny Dantsin, Andrei Voronkov. fossacs 1999: 180-196

1997

Complexity of Query Answering in Logic Databases with Complex ValuesEvgeny Dantsin, Andrei Voronkov. lfcs 1997: 56-66

Complexity and Expressive Power of Logic ProgrammingEvgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov. cocoon 1997: 82-101 [doi]

1991

Probabilistic Logic Programs and their SemanticsEvgeny Dantsin. lpar 1992: 152-164

1988

Algorihtms for Probabilistic InferenceEvgeny Dantsin. jic 1990: 67-75

Sign in or sign up to see more results.

runs on WebDSL