Back to Results
First PageMeta Content
Computer programming / Local consistency / Constraint satisfaction / Constraint logic programming / Co-NP-complete / NP-complete / Decomposition method / Complexity of constraint satisfaction / Constraint programming / Software engineering / Theoretical computer science


The Complexity of Global Constraints Christian Bessiere Emmanuel Hebrard and Brahim Hnich and Toby Walsh∗ LIRMM
Add to Reading List

Document Date: 2010-11-22 06:22:27

Open Document

File Size: 87,94 KB

Share Result on Facebook

City

Milano / Deville / /

Company

3SAT / Pall / Pearson / /

Country

Ireland / /

Currency

pence / /

/

Facility

GACS UP PORT / Swedish Institute of Computer Science / /

IndustryTerm

constraint networks / basic tools / required scalar product / greedy algorithm / tree search algorithms / constraint propagation algorithms / scalar product / search space / constraint propagation algorithm / search problems / propagation algorithm / /

Organization

American Association for Artificial IntelliCopyright / Science Foundation Ireland / Swedish Institute of Computer Science / /

Person

Van Hentenryck / Brahim Hnich / Toby Walsh / Christian Bessiere Emmanuel Hebrard / /

Technology

filtering algorithm / GAC algorithm / polynomial GAC algorithm / propagation algorithm / artificial intelligence / GAC-Schema algorithm / tree search algorithms / developing constraint propagation algorithm / constraint propagation algorithms / greedy algorithm / /

URL

www.aaai.org / /

SocialTag