Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard

Artificial Intelligence 132 (1):105-117 (2001)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0004-3702(01)00146-1

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,343

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Approximating cost-based abduction is NP-hard.Ashraf M. Abdelbar - 2004 - Artificial Intelligence 159 (1-2):231-239.
Finding MAPs for belief networks is NP-hard.Solomon Eyal Shimony - 1994 - Artificial Intelligence 68 (2):399-410.
Approximating probabilistic inference in Bayesian belief networks is NP-hard.Paul Dagum & Michael Luby - 1993 - Artificial Intelligence 60 (1):141-153.
Approximating MAPs for belief networks is NP-hard and other theorems.Ashraf M. Abdelbar & Sandra M. Hedetniemi - 1998 - Artificial Intelligence 102 (1):21-38.
Backjumping for Quantified Boolean Logic satisfiability.Enrico Giunchiglia, Massimo Narizzano & Armando Tacchella - 2003 - Artificial Intelligence 145 (1-2):99-120.
Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem.Dogan Corus, Pietro S. Oliveto & Donya Yazdani - 2019 - Artificial Intelligence 274 (C):180-196.
Approximate belief updating in max-2-connected Bayes networks is NP-hard.Erez Karpas, Solomon Eyal Shimony & Amos Beimel - 2009 - Artificial Intelligence 173 (12-13):1150-1153.
Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition.Rina Dechter - 1990 - Artificial Intelligence 41 (3):273-312.
A conflict-directed approach to chance-constrained mixed logical linear programming.Cheng Fang & Brian C. Williams - 2023 - Artificial Intelligence 323 (C):103972.
Pool resolution is NP-hard to recognize.Samuel R. Buss - 2009 - Archive for Mathematical Logic 48 (8):793-798.

Analytics

Added to PP
2020-12-22

Downloads
9 (#1,560,696)

6 months
4 (#864,415)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Exploiting the deep structure of constraint problems.Colin P. Williams & Tad Hogg - 1994 - Artificial Intelligence 70 (1-2):73-117.

Add more references