Hard problems for CSP algorithms

被引：0

作者：

Mitchell, DG ^{[1
]}

机构：

[1] Univ Toronto, Dept Comp Sci, Toronto, ON M5S 3G4, Canada

来源：

FIFTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-98) AND TENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICAL INTELLIGENCE (IAAI-98) - PROCEEDINGS | 1998年

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We prove exponential lower bounds on the running time of many algorithms for Constraint Satisfaction, by giving a simple family of instances on which they always take exponential time. Although similar lower bounds for most of these algorithms have been shown before, we provide a uniform treatment which illustrates a powerful general approach and has stronger implications for the practice of algorithm design.

引用

页码：398 / 405

页数：8

共 50 条

[21] Intelligent sieve algorithms and tests for solving the hard problems on lattice
Zhu S.
Han Y.
Yang X.
Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2021, 49 (02): : 37 - 43
[22] Efficient genetic algorithms for solving hard constrained optimization problems
Sareni, B
Krähenbühl, L
Nicolas, A
IEEE TRANSACTIONS ON MAGNETICS, 2000, 36 (04) : 1027 - 1030
[23] On exact algorithms for the permutation CSP
Kim, Eun Jung
Goncalves, Daniel
THEORETICAL COMPUTER SCIENCE, 2013, 511 : 109 - 116
[24] Replication-based inference algorithms for hard computational problems
Alamino, Roberto C.
Neirotti, Juan P.
Saad, David
PHYSICAL REVIEW E, 2013, 88 (01):
[25] FAST ALGORITHMS FOR N-DIMENSIONAL RESTRICTIONS OF HARD PROBLEMS
DERHEIDE, FMA
JOURNAL OF THE ACM, 1988, 35 (03) : 740 - 747
[26] SOME OBSERVATIONS ON THE PROBABILISTIC ALGORITHMS AND NP-HARD PROBLEMS
KO, KI
INFORMATION PROCESSING LETTERS, 1982, 14 (01) : 39 - 43
[27] Hard and soft priority in CSP.
Lawrence, AE
ARCHITECTURES, LANGUAGES AND TECHNIQUES FOR CONCURRENT SYSTEMS, 1999, 57 : 169 - 195
[28] Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
Jens Gramm
Jiong Guo
Falk Hüffner
Rolf Niedermeier
Algorithmica , 2004, 39 : 321 - 347
[29] Approximation algorithms for PSPACE-hard hierarchically and periodically specified problems
Marathe, MV
Hunt, HB
Stearns, RE
Radhakrishnan, V
SIAM JOURNAL ON COMPUTING, 1998, 27 (05) : 1237 - 1261
[30] Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
Irving, Robert W.
Manlove, David F.
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2008, 16 (03) : 279 - 292

← 1 2 3 4 5 →