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


The Complexity of Reasoning with Global Constraints Christian Bessiere LIRMM, CNRS/U. Montpellier Montpellier, France [removed]
Add to Reading List

Document Date: 2006-09-13 04:55:34

Open Document

File Size: 192,86 KB

Share Result on Facebook

Company

3SAT / /

Country

Australia / /

Currency

pence / /

/

Facility

Brahim Hnich Izmir University of Economics Izmir / /

IndustryTerm

use constraint propagation algorithms / polynomial algorithm / 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

Toby Walsh / Christian Bessiere / Emmanuel Hebrard / /

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