Back to Results
First PageMeta Content
Applied mathematics / Parameterized complexity / Constraint satisfaction problem / Constraint satisfaction / Idempotence / Local consistency / P versus NP problem / Sheaf / Complexity of constraint satisfaction / Constraint programming / Mathematics / Theoretical computer science


On Backdoors To Tractable Constraint Languages Clement Carbonnel1,3 , Martin C. Cooper2 , and Emmanuel Hebrard1 1 3
Add to Reading List

Document Date: 2014-05-28 03:24:32

Open Document

File Size: 323,28 KB

Share Result on Facebook

City

Toulouse / /

Company

Vertex / /

/

Facility

University of Toulouse / /

IndustryTerm

bounded search tree / idempotent composite classes such algorithms / search tree / constraint network / natural algorithm / /

OperatingSystem

XP / /

Organization

University of Toulouse / /

Person

Gomes / Roche / /

Position

rt / avenue du colonel / General / /

Technology

natural algorithm / same algorithm / alternative algorithm / /

SocialTag