In an age of ubiquitous computing, computational complexity theory is the science that studies what problems can be efficiently solved by computation. Since the founding work of the 1970s, an influential line of research has zoomed in on NP-complete problems, with the satisfiability problem for Boolean logic formulas (SAT) at its head, which turned out to be exactly the right notion to capture literally thousands of important applied problems in different fields. Based on the assumption of the hardness of NP, whose validity is one of the famous Millennium Prize Problems, a rich mathematical theory has been developed for establishing conditional results that state that all these problems are infeasible to solve, in the worst case.
The trouble is that real problems are not worst-case. The last two decades have seen the development of exceedingly efficient algorithms for many of these problems, perhaps most impressively in the form of so-called SAT solvers for logic formulas. Traditional complexity analysis claiming exponential lower bounds is arguably not very relevant in this setting, but this also means that we lack tools to understand how these algorithms can perform so well and why they sometimes spectacularly fail.
This program will bring together leading theoreticians and practitioners that work on SAT and its generalizations, and approach it from all possible angles: complexity theory, logic, computational algebra, optimization, SAT solving, constraint programming, random instances, SAT modulo theories (SMT), etc. The goal is to develop a better mathematical understanding of real-world efficient computation, and to work towards further algorithmic progress on problems that are currently beyond reach. So far, theoretical and applied research in these areas has developed mostly separately, but several joint workshops in recent years showed that the communities are eager for more interaction. This program is hence an opportunity for a longer-term collaboration and exchange of ideas between theoreticians and practitioners, that has potential for significant long-term impact in mathematics, computer science, and industry. This semester program could provide a decisive contribution in building a joint community of researchers working on constructing efficient algorithms and analyzing the computational complexity of applied problems.
sympa [at] lists.simons.berkeley.edu (body: subscribe%20sat2021announcements%40lists.simons.berkeley.edu) (Click here to subscribe to our announcements email list for this program).
Albert Atserias (Universitat Politècnica de Catalunya; chair), Sam Buss (UC San Diego), Vijay Ganesh (University of Waterloo), Antonina Kolokolova (Memorial University of Newfoundland), Jakob Nordström (University of Copenhagen & Lund University)
List of participants (tentative list, including organizers):
Albert Atserias (Universitat Politècnica de Catalunya), Paul Beame (University of Washington), Christoph Berkholz (Humboldt-Universität zu Berlin), Olaf Beyersdorff (Friedrich-Schiller University of Jena), Nikolaj Bjorner (Microsoft Research), Maria Luisa Bonet (Universitat Politècnica de Catalunya), Sam Buss (UC San Diego), Anuj Dawar (University of Cambridge), Vijay Ganesh (University of Waterloo), Neil Immerman (University of Massachusetts Amherst), Russell Impagliazzo (UC San Diego), Valentine Kabanets (Simon Fraser University), Phokion Kolaitis (UC Santa Cruz), Antonina Kolokolova (Memorial University of Newfoundland), Oliver Kullmann (Swansea University), Jordi Levy (Artificial Intelligence Research Institute, Spanish National Research Council), Susan Margulies (United States Naval Academy), Joao Marques-Silva (University of Toulouse), Ciaran McCreesh (University of Glasgow), Kuldeep Singh Meel (National University of Singapore), Jakob Nordström (University of Copenhagen & Lund University), Mohan Paturi (UC San Diego), Toni Pitassi (University of Toronto), Pavel Pudlák (Czech Academy of Sciences), Barna Saha (UC Berkeley), Karem Sakallah (University of Michigan), Rahul Santhanam (University of Oxford), Dana Scott (UC Berkeley & Carnegie Mellon University), Laurent Simon (Bordeaux INP), Stefan Szeider (TU Wien), Marc Vinyals (Technion - Israel Institute of Technology), Ryan Williams (Massachusetts Institute of Technology)
Susanna de Rezende (Czech Academy of Sciences), Katalin Fazekas (Johannes Kepler University Linz), Johannes Fichte (TU Dresden), Noah Fleming (University of Toronto), Stephan Gocht (Lund University), Aditya Grover (Facebook AI Research), Andrea Lincoln (Massachusetts Institute of Technology), Joanna Ochremiak (Centre National de Recherche Scientifique), Ralf Rothenberger (University of Potsdam)
Visiting Graduate Students and Postdocs:
Benjamin Boehm (Friedrich-Schiller University of Jena), Akhil Dixit (UC Santa Cruz), Lukáš Folwarczný (Charles University Prague), Priyanka Golia (National University of Singapore), Markus Hecher (TU Wien), Jan Pich (Oxford University), Yash Pote (National University of Singapore), André Schidler (TU Wien), Navid Talebanfard (Czech Academy of Sciences), Nikhil Vyas (Massachusetts Institute of Technology), Jack Wesley (UC Davis)
Long-Term Participants (including Organizers):
Those interested in participating in this program should send email to the organizers sat2021 [at] lists.simons.berkeley.edu (at this address).