Back to Results
First PageMeta Content
Applied mathematics / Mathematical optimization / Local consistency / Constraint satisfaction / NP-complete / Computational complexity theory / P versus NP problem / NP / Complexity of constraint satisfaction / Constraint programming / Theoretical computer science / Complexity classes


Constraints DOIs10601The Complexity of Reasoning with Global Constraints Christian Bessiere · Emmanuel Hebrard · Brahim Hnich · Toby Walsh
Add to Reading List

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

Open Document

File Size: 442,71 KB

Share Result on Facebook

Company

3SAT / Business Media LLC / /

Country

Turkey / France / Ireland / /

/

Facility

B. Hnich Izmir University of Economics / /

IndustryTerm

polynomial algorithm / use constraint propagation algorithms / polynomial propagation algorithms / generic arc consistency algorithms / basic tools / search tree / propagation algorithms / industrial applications / search space / tree search algorithms / propagation algorithm / /

Organization

University of Economics / Izmir / /

Person

Emmanuel Hebrard / Christian Bessiere / Toby Walsh / /

Position

representative / head / /

Technology

generic arc consistency algorithms / propagation algorithms / GAC algorithm / propagation algorithm / polynomial propagation algorithms / use constraint propagation algorithms / tree search algorithms / polynomial algorithm / /

SocialTag