Constraints

About this blog

Constraint satisfaction is where AI, universal algebra, computational complexity, graph theory, finite model theory, and group theory all overlap. Maybe we can shoehorn topology and ergodic theory in there, too…

In 2014 I completed a doctorate in computer science at the University of Oxford. In my thesis Transformations of representations in constraint satisfaction, I tackled some of these connections to study hybrid tractability of constraint satisfaction. See András Salamon at Google Scholar for my papers. My old academic homepage was András Salamon at Oxford Computer Science.

Leave a Comment »

No comments yet.

RSS feed for comments on this post. TrackBack URI

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

Create a free website or blog at WordPress.com.

%d bloggers like this: