Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Dantsin, Evgeny"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Exponential complexity of satisfiability testing for linear-size Boolean formulas
Evgeny Dantsin
,
Alexander Wolpert
Lecture Notes in Computer Science
7878
, 2013, pp. 110-121
Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms
Evgeny Dantsin
,
Edward A. Hirsch
,
Alexander Wolpert
Lecture Notes in Computer Science
3998
, 2006, pp. 60-68
Algorithms for SAT based on search in Hamming balls
Evgeny Dantsin
,
Edward A. Hirsch
,
Alexander Wolpert
Lecture Notes in Computer Science
2996
, 2004, pp. 141-151
A robust DNA computation model that captures PSPACE
Evgeny Dantsin
,
Alexander Wolpert
International Journal of Foundations of Computer Science
14
(5), 2003, pp. 933-951
A deterministic
(2-2/(k+1))^n
algorithm for
k
-SAT based on local search
Evgeny Dantsin
,
Andreas Goerdt
,
Edward A. Hirsch
,
Ravi Kannan
,
Jon Kleinberg
,
Christos Papadimitriou
,
Prabhakar Raghavan
,
Uwe Schöning
Theoretical Computer Science
289
(1), 2002, pp. 69-83
Solving constraint satisfaction problems with DNA computing
Evgeny Dantsin
,
Alexander Wolpert
Lecture Notes in Computer Science
2387
, 2002, pp. 171-180
Algorithms for SAT and upper bounds on their complexity
Evgeny Dantsin
,
Edward A. Hirsch
,
Sergei Ivanov
,
Maxim Vsemirnov
Technical Report (TR01-012), 2001
Deterministic algorithms for
k
-SAT based on covering codes and local search
Evgeny Dantsin
,
Andreas Goerdt
,
Edward A. Hirsch
,
Uwe Schöning
Lecture Notes in Computer Science
1853
, 2000, pp. 236-247
Complexity and expressive power of logic programming
Evgeny Dantsin
,
Thomas Eiter
,
Georg Gottlob
,
Andrei Voronkov
Proceedings of the 12th Annual IEEE Conference on Computational Complexity (Ulm, Germany, June 24-27, 1997)
, 1997, pp. 82-101
Complexity of query answering in logic databases with complex values
Evgeny Dantsin
,
Andrei Voronkov
Lecture Notes in Computer Science
1234
, 1997, pp. 56-66