Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas

被引：0

作者：

机构：

[1] Alekhnovich, Michael

[2] Hirsch, Edward A.

[3] Itsykson, Dmitry

来源：

Alekhnovich, M. (misha@ias.edu) | 1600年 / Kluwer Academic Publishers卷 / 35期

关键词：

Algorithms;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：1 / 3

共 50 条

[1] Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas
Michael Alekhnovich
Edward A. Hirsch
Dmitry Itsykson
Journal of Automated Reasoning, 2005, 35 : 51 - 72
[2] Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
Alekhnovich, Michael
Hirsch, Edward A.
Itsykson, Dmitry
JOURNAL OF AUTOMATED REASONING, 2005, 35 (1-3) : 51 - 72
[3] Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
Alekhnovich, M
Hirsch, EA
Itsykson, D
AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 84 - 96
[4] General Lower Bounds for the Running Time of Evolutionary Algorithms
Sudholt, Dirk
PARALLEL PROBLEMS SOLVING FROM NATURE - PPSN XI, PT I, 2010, 6238 : 124 - 133
[5] Lower Bounds for Myopic DPLL Algorithms with a Cut Heuristic
Itsykson, Dmitry
Sokolov, Dmitry
ALGORITHMS AND COMPUTATION, 2011, 7074 : 464 - 473
[6] Hard satisfiable instances for DPLL-type algorithms
Nikolenko S.I.
Journal of Mathematical Sciences, 2005, 126 (3) : 1205 - 1209
[7] A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms
Sudholt, Dirk
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2013, 17 (03) : 418 - 435
[8] EXPONENTIAL LOWER BOUNDS ON A CLASS OF KNAPSACK ALGORITHMS
HAUSMANN, D
KANNAN, R
KORTE, B
MATHEMATICS OF OPERATIONS RESEARCH, 1981, 6 (02) : 225 - 232
[9] EXPONENTIAL BOUNDS FOR THE RUNNING TIME OF A SELECTION ALGORITHM
DEVROYE, L
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1984, 29 (01) : 1 - 7
[10] Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas
Benjamin Doerr
Frank Neumann
Andrew M. Sutton
Algorithmica, 2017, 78 : 561 - 586

← 1 2 3 4 5 →