( en | de | ru )

 

Disambiguation of "Dantsin, Evgeny"

Author of the publication

copydeleteadd this publication to your clipboard
A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search.

, , , , , , , and . Theor. Comput. Sci., 289 (1): 69-83 (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Evgeny Pilipenko

Evgeny Epelbaum

Evgeny Volkov

Evgeny Gutyrchik

Evgeny Minin

 

Other publications of authors with the same name

A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length., and . J. Satisf. Boolean Model. Comput., 1 (1): 49-60 (2006)Worst-Case Upper Bounds., and . Handbook of Satisfiability, volume 336 of Frontiers in Artificial Intelligence and Applications, IOS Press, (2021)A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees., and . FoSSaCS, volume 1578 of Lecture Notes in Computer Science, page 180-196. Springer, (1999)An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF., and . J. Satisf. Boolean Model. Comput., 14 (1): 1-15 (2023)Probabilistic Logic Programs and their Semantics.. RCLP, volume 592 of Lecture Notes in Computer Science, page 152-164. Springer, (1991)On quantum versions of record-breaking algorithms for SAT., , and . SIGACT News, 36 (4): 103-108 (2005)A Robust Dna Computation Model That Captures Pspace., and . Int. J. Found. Comput. Sci., 14 (5): 933- (2003)Algorithms for SAT based on search in Hamming balls, , and . Electron. Colloquium Comput. Complex., (2003)Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms, , and . Electron. Colloquium Comput. Complex., (2005)Complexity and Expressive Power of Logic Programming., , , and . CCC, page 82-101. IEEE Computer Society, (1997)