>
you're reading...
Announcements

Reading group meeting: On the Subexponential Time Complexity of CSP

Time: 1:00pm Tuesday 6 August.

Location: SIT 402

Speaker: Serge Gaspers, UNSW

Paper: On the Subexponential Time Complexity of CSP by Iyad Kanj, Stefan Szeider.

Abstract:

A CSP with n variables ranging over a domain of d values can be solved by brute-force in d^n steps (omitting a polynomial factor). With a more careful approach, this trivial upper bound can be improved for certain natural restrictions of the CSP. In this paper we establish theoretical limits to such improvements, and draw a detailed landscape of the subexponential-time complexity of CSP.
We first establish relations between the subexponential-time complexity of CSP and that of other problems, including CNF-Sat. We exploit this connection to provide tight characterizations of the subexponential-time complexity of CSP under common assumptions in complexity theory. For several natural CSP parameters, we obtain threshold functions that precisely dictate the subexponential-time complexity of CSP with respect to the parameters under consideration.
Our analysis provides fundamental results indicating whether and when one can significantly improve on the brute-force search approach for solving CSP.

Reference: Iyad Kanj, Stefan Szeider. On the Subexponential Time Complexity of CSP. Proceedings of AAAI 2013.

Advertisements

Discussion

No comments yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Enter your email address to subscribe to receive notifications of new announcements by email.

Join 68 other followers

%d bloggers like this: