COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Algorithms and Complexity Seminar > When and why do efficient algorithms exist (for constraint satisfaction and beyond)?

## When and why do efficient algorithms exist (for constraint satisfaction and beyond)?Add to your list(s) Download to your calendar using vCal - Venkatesan Guruswami (UC Berkeley)
- Wednesday 19 June 2024, 14:00-15:00
- Computer Laboratory, William Gates Building, FW26.
If you have a question about this talk, please contact Tom Gur. Computational problems exhibit a diverse range of behaviors in terms of how quickly and effectively they can be solved. What underlying mathematical structure (or lack thereof) in a computational problem leads to an efficient algorithm for solving it (or dictates its intractability)? Given the vast landscape of problems and algorithmic approaches, it would be simplistic to hope for a universal theory explaining the underpinnings of easiness/hardness. Yet, in the realm of constraint satisfaction problems (CSP), the algebraic dichotomy theorem gives a definitive answer: a polynomial time algorithm exists when there are non-trivial local operations called polymorphisms under which the solution space is closed; otherwise the problem is NP-complete. Inspired and emboldened by this, one might speculate a polymorphic principle in more general contexts, with symmetries in the solution space governing efficient algorithms. Beginning with some background on CSP and the polymorphic approach to understanding their complexity, the talk will discuss some extensions beyond CSP where the polymorphic principle seems promising (yet far from understood). In particular, we will discuss ``promise CSP ’’ (PCSP) where one is allowed to satisfy a relaxed version of the constraints (a framework that includes important problems like approximate graph coloring). We will provide glimpses of the emerging polymorphic theory characterizing the (in)tractability of interesting classes of PCSP as well as the ability of natural classes of algorithms to solve them. This talk is part of the Algorithms and Complexity Seminar series. ## This talk is included in these lists:- Algorithms and Complexity Seminar
- All Talks (aka the CURE list)
- Cambridge talks
- Computer Laboratory, William Gates Building, FW26
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- School of Technology
- Trust & Technology Initiative - interesting events
- bld31
- ki287
Note that ex-directory lists are not shown. |
## Other listsEgyptian World Seminar Series (Department of Archaeology) Public Engagement in the 21st Century Sustainable Development Research Seminars## Other talksSpontaneous Transitions in Fish Schools Approximate solutions to Wiener-Hopf equations via the implicit quadrature scheme Mathematics-informed neural network for 2x2 matrix factorisation and a new Wiener-Hopf model for aeroengine noise radiation Operator Algebras Lecture series of "The Past Metallurgists Society" - Day 1 What's New in Thoracic Cancer? |