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 条

[41] Analytical models for CSP problems
Butenkov, SA
2002 IEEE INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE SYSTEMS, PROCEEDINGS, 2002, : 273 - 275
[42] Holant Problems and Counting CSP
Cai, Jin-Yi
Lu, Pinyan
Xia, Mingji
STOC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2009, : 715 - 724
[43] Complexity of Approximating CSP with Balance / Hard Constraints
Venkatesan Guruswami
Euiwoong Lee
Theory of Computing Systems, 2016, 59 : 76 - 98
[44] Complexity of Approximating CSP with Balance/Hard Constraints
Guruswami, Venkatesan
Lee, Euiwoong
THEORY OF COMPUTING SYSTEMS, 2016, 59 (01) : 76 - 98
[45] Developing two heuristic algorithms with metaheuristic algorithms to improve solutions of optimization problems with soft and hard constraints: An application to nurse rostering problems
Chen, Ping-Shun
Zeng, Zhi-Yang
APPLIED SOFT COMPUTING, 2020, 93
[46] Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems
Kel'manov, A. V.
Romanchenko, S. M.
AUTOMATION AND REMOTE CONTROL, 2012, 73 (02) : 349 - 354
[47] HARD PROBLEMS IN GENE SEQUENCE ANALYSIS: CLASSICAL APPROACHES AND SUITABILITY OF GENETIC ALGORITHMS
Jantschi, L.
Bolboaca, S. D.
Sestras, R. E.
BIOTECHNOLOGY & BIOTECHNOLOGICAL EQUIPMENT, 2009, 23 (02) : 1275 - 1280
[48] Parallel Island Model Genetic Algorithms applied in NP-Hard problems
da Silveira, Lucas A.
Soncco-Alvarez, Jose L.
de Lima, Thaynara A.
Ayala-Rincon, Mauricio
2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 3262 - 3269
[49] Parallel Algorithms for Hard Combinatorial Optimisation Problems in Multi-Agent Systems
Bistaffa, Filippo
AAMAS'14: PROCEEDINGS OF THE 2014 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS, 2014, : 1717 - 1718
[50] Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems
A. V. Kel’manov
S. M. Romanchenko
Automation and Remote Control, 2012, 73 : 349 - 354

← 1 2 3 4 5 →