Open AccessOn the Subexponential Time Complexity of CSP
Author(s) -
Iyad Kanj,
Stefan Szeider
Publication year - 2013
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v27i1.8609
Subject(s) - constraint satisfaction problem , time complexity , constraint (computer aided design) , computational complexity theory , upper and lower bounds , mathematics , brute force , computer science , domain (mathematical analysis) , exploit , theoretical computer science , algorithm , mathematical optimization , artificial intelligence , mathematical analysis , geometry , computer security , probabilistic logic
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom