A Unified Theory of Algorithmic Relaxations

Project Information

AUTAR

Grant agreement ID: 648276

DOI

10.3030/648276

Project closed

EC signature date 27 May 2015

Start date 1 June 2015

End date 30 September 2020

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 1 725 656,00

EU contribution

€ 1 725 656,00

Coordinated by

UNIVERSITAT POLITECNICA DE CATALUNYA
Spain

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Peer reviewed articles (14)

Definable inapproximability: new challenges for duplicator

Author(s): Albert Atserias, Anuj Dawar
Published in: Journal of Logic and Computation, Issue 29/8, 2019, Page(s) 1185-1210, ISSN 0955-792X
Publisher: Oxford University Press
DOI: 10.1093/logcom/exz022

Quantum and non-signalling graph isomorphisms

Author(s): Albert Atserias, Laura Mančinska, David E. Roberson, Robert Šámal, Simone Severini, Antonios Varvitsiotis
Published in: Journal of Combinatorial Theory, Series B, Issue 136, 2019, Page(s) 289-328, ISSN 0095-8956
Publisher: Academic Press
DOI: 10.1016/j.jctb.2018.11.002

A remark on pseudo proof systems and hard instances of the satisfiability problem

Author(s): Jan Maly, Moritz Müller
Published in: Mathematical Logic Quarterly, Issue 64/6, 2018, Page(s) 418-428, ISSN 0942-5616
Publisher: John Wiley & Sons Ltd.
DOI: 10.1002/malq.201700009

Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers

Author(s): Cristina Borralleras, Daniel Larraz, Enric Rodríguez-Carbonell, Albert Oliveras, Albert Rubio
Published in: ACM Transactions on Computational Logic, Issue 20/4, 2019, Page(s) 1-36, ISSN 1529-3785
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3340923

Antimagic labelings of caterpillars

Author(s): Antoni Lozano, Mercè Mora, Carlos Seara
Published in: Applied Mathematics and Computation, Issue 347, 2019, Page(s) 734-740, ISSN 0096-3003
Publisher: Elsevier BV
DOI: 10.1016/j.amc.2018.11.043

Relative Entailment Among Probabilistic Implications

Author(s): Albert Atserias, José L. Balcázar, Marie Ely Piceno
Published in: Logical Methods in Computer Science, 2019, ISSN 1860-5974
Publisher: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-15(1:10)2019

Co-occurrence patterns in diagnostic data

Author(s): Marie Ely Piceno, Laura Rodríguez-Navas, José Luis Balcázar
Published in: Computational Intelligence, 2020, ISSN 0824-7935
Publisher: Blackwell Publishing Inc.
DOI: 10.1111/coin.12317

Automating Resolution is NP-Hard

Author(s): Albert Atserias, Moritz Müller
Published in: Journal of the ACM, Issue 67/5, 2020, Page(s) 1-17, ISSN 0004-5411
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3409472

Proof Complexity Meets Algebra

Author(s): Albert Atserias, Joanna Ochremiak
Published in: ACM Transactions on Computational Logic, Issue 20/1, 2019, Page(s) 1-46, ISSN 1529-3785
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3265985

Polynomial time ultrapowers and the consistency of circuit lower bounds

Author(s): Jan Bydžovský, Moritz Müller
Published in: Archive for Mathematical Logic, Issue 59/1-2, 2020, Page(s) 127-147, ISSN 0933-5846
Publisher: Springer Verlag
DOI: 10.1007/s00153-019-00681-y

The parameterized space complexity of model-checking bounded variable first-order logic

Author(s): Yijia Chen, Michael Elberfeld, Moritz Müller
Published in: Logical Methods in Computer Science, 2019, ISSN 1860-5974
Publisher: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-15(3:31)2019

Generalized satisfiability problems via operator assignments

Author(s): Albert Atserias, Phokion G. Kolaitis, Simone Severini
Published in: Journal of Computer and System Sciences, Issue 105, 2019, Page(s) 171-198, ISSN 0022-0000
Publisher: Academic Press
DOI: 10.1016/j.jcss.2019.05.003

Probabilities of first-order sentences on sparse random relational structures: an application to definability on random CNF formulas

Author(s): Lázaro Alberto Larrauri
Published in: Journal of Logic and Computation, 2020, ISSN 0955-792X
Publisher: Oxford University Press
DOI: 10.1093/logcom/exaa061

Feasibly constructive proofs of succinct weak circuit lower bounds

Author(s): Moritz Müller, Ján Pich
Published in: Annals of Pure and Applied Logic, Issue 171/2, 2020, Page(s) 102735, ISSN 0168-0072
Publisher: Elsevier BV
DOI: 10.1016/j.apal.2019.102735

Conference proceedings (16)

Clique is hard on average for regular resolution

Author(s): Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander Razborov
Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018, 2018, Page(s) 866-877, ISBN 9781450355599
Publisher: ACM Press
DOI: 10.1145/3188745.3188856

On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface

Author(s): Albert Atserias, Stephan Kreutzer, Marc Noy
Published in: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), 2018
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2018.116

Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem

Author(s): Albert Atserias, Joanna Ochremiak
Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018, Page(s) 66-75, ISBN 9781450355834
Publisher: ACM
DOI: 10.1145/3209108.3209186

Feasible Interpolation for Polynomial Calculus and Sums-Of-Squares

Author(s): Tuomas Hakoniemi
Published in: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), 2020
Publisher: Schloss Dagstuhl--Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2020.63

A parameterized halting problem, the linear time hierarchy, and the MRDP theorem

Author(s): Yijia Chen, Moritz Müller, Keita Yokoyama
Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018, Page(s) 235-244, ISBN 9781450355834
Publisher: ACM
DOI: 10.1145/3209108.3209155

Resolution Lower Bounds for Refutation Statements

Author(s): Michal Garlík
Published in: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), 2019
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.mfcs.2019.37

Generalized Satisfiability Problems via Operator Assignments

Author(s): Albert Atserias, Phokion G. Kolaitis, Simone Severini
Published in: 21st International Symposium, FCT 2017, Issue Lecture Notes in Computer Science 10472, 2017, Page(s) 56-68, ISBN 978-3-662-55750-1
Publisher: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-55751-8_6

Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases

Author(s): Massimo Lauria, Jakob Nordstrom
Published in: 32nd Computational Complexity Conference (CCC 2017), Issue 79, 2017, Page(s) 2:1--2:20, ISBN 978-3-95977-040-8
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.CCC.2017.2

Entropy Bounds for Conjunctive Queries with Functional Dependencies

Author(s): Tomasz Gogacz, Szymon Torunczyk
Published in: 20th International Conference on Database Theory (ICDT 2017), Issue LIPIcs 68, 2017, Page(s) 15:1--15:17
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICDT.2017.15

Proof Complexity Meets Algebra

Author(s): Albert Atserias, Joanna Ochremiak
Published in: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Issue 80, 2017, Page(s) 110:1--110:14, ISBN 978-3-95977-041-5
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2017.110

Derandomizing Isolation in Space-Bounded Settings

Author(s): Dieter van Melkebeek, Gautam Prakriya
Published in: 32nd Computational Complexity Conference (CCC 2017), Issue 79, 2017, Page(s) 5:1--5:32, ISBN 978-3-95977-040-8
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.CCC.2017.5

Non-Homogenizable Classes of Finite Structures

Author(s): Albert Atserias, Szymon Torunczyk
Published in: 25th EACSL Annual Conference on Computer Science Logic, CSL 2016, 2016, Page(s) 16:16:00, ISBN 978-3-95977-022-4
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.CSL.2016.16

Homomorphism Problems for First-Order Definable Structures

Author(s): Bartek Klin, Slawek Lasota, Joanna Ochremiak, Szymon Torunczyk
Published in: 36th Foundations of Software Technology and Theoretical Computer Science, 2016, Page(s) 14:15, ISBN 978-3-95977-027-9
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.FSTTCS.2016.14

On the Power of Symmetric Linear Programs

Author(s): Albert Atserias, Anuj Dawar, Joanna Ochremiak
Published in: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019, Page(s) 1-13, ISBN 978-1-7281-3608-0
Publisher: IEEE
DOI: 10.1109/lics.2019.8785792

Automating Resolution is NP-Hard

Author(s): Albert Atserias, Moritz Muller
Published in: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, Page(s) 498-509, ISBN 978-1-7281-4952-3
Publisher: IEEE
DOI: 10.1109/focs.2019.00038

Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz Proofs

Author(s): Albert Atserias, Tuomas Hakoniemi
Published in: 34th Computational Complexity Conference (CCC 2019), 2019
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.ccc.2019.24

Other (1)

Limiting probabilities of first order properties of random sparse graphs and hypergraphs

Author(s): Alberto Larrauri, Tobias Müller, Marc Noy
Published in: 2020
Publisher: Cornell University

Book chapters (2)

Circular (Yet Sound) Proofs

Author(s): Albert Atserias, Massimo Lauria
Published in: Theory and Applications of Satisfiability Testing – SAT 2019 - 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9–12, 2019, Proceedings, Issue 11628, 2019, Page(s) 1-18, ISBN 978-3-030-24257-2
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-24258-9_1

Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers

Author(s): Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals
Published in: Theory and Applications of Satisfiability Testing – SAT 2016, 2016, Page(s) 160-176, ISBN 978-3-319-40970-2
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-40970-2_11