A Unified Theory of Algorithmic Relaxations

Definable inapproximability: new challenges for duplicator

Autori: Albert Atserias, Anuj Dawar
Pubblicato in: Journal of Logic and Computation, Numero 29/8, 2019, Pagina/e 1185-1210, ISSN 0955-792X
Editore: Oxford University Press
DOI: 10.1093/logcom/exz022

Quantum and non-signalling graph isomorphisms

Autori: Albert Atserias, Laura Mančinska, David E. Roberson, Robert Šámal, Simone Severini, Antonios Varvitsiotis
Pubblicato in: Journal of Combinatorial Theory, Series B, Numero 136, 2019, Pagina/e 289-328, ISSN 0095-8956
Editore: Academic Press
DOI: 10.1016/j.jctb.2018.11.002

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

Autori: Jan Maly, Moritz Müller
Pubblicato in: Mathematical Logic Quarterly, Numero 64/6, 2018, Pagina/e 418-428, ISSN 0942-5616
Editore: John Wiley & Sons Ltd.
DOI: 10.1002/malq.201700009

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

Autori: Cristina Borralleras, Daniel Larraz, Enric Rodríguez-Carbonell, Albert Oliveras, Albert Rubio
Pubblicato in: ACM Transactions on Computational Logic, Numero 20/4, 2019, Pagina/e 1-36, ISSN 1529-3785
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3340923

Antimagic labelings of caterpillars

Autori: Antoni Lozano, Mercè Mora, Carlos Seara
Pubblicato in: Applied Mathematics and Computation, Numero 347, 2019, Pagina/e 734-740, ISSN 0096-3003
Editore: Elsevier BV
DOI: 10.1016/j.amc.2018.11.043

Relative Entailment Among Probabilistic Implications

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

Co-occurrence patterns in diagnostic data

Autori: Marie Ely Piceno, Laura Rodríguez-Navas, José Luis Balcázar
Pubblicato in: Computational Intelligence, 2020, ISSN 0824-7935
Editore: Blackwell Publishing Inc.
DOI: 10.1111/coin.12317

Automating Resolution is NP-Hard

Autori: Albert Atserias, Moritz Müller
Pubblicato in: Journal of the ACM, Numero 67/5, 2020, Pagina/e 1-17, ISSN 0004-5411
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3409472

Proof Complexity Meets Algebra

Autori: Albert Atserias, Joanna Ochremiak
Pubblicato in: ACM Transactions on Computational Logic, Numero 20/1, 2019, Pagina/e 1-46, ISSN 1529-3785
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3265985

Polynomial time ultrapowers and the consistency of circuit lower bounds

Autori: Jan Bydžovský, Moritz Müller
Pubblicato in: Archive for Mathematical Logic, Numero 59/1-2, 2020, Pagina/e 127-147, ISSN 0933-5846
Editore: Springer Verlag
DOI: 10.1007/s00153-019-00681-y

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

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

Generalized satisfiability problems via operator assignments

Autori: Albert Atserias, Phokion G. Kolaitis, Simone Severini
Pubblicato in: Journal of Computer and System Sciences, Numero 105, 2019, Pagina/e 171-198, ISSN 0022-0000
Editore: 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

Autori: Lázaro Alberto Larrauri
Pubblicato in: Journal of Logic and Computation, 2020, ISSN 0955-792X
Editore: Oxford University Press
DOI: 10.1093/logcom/exaa061

Feasibly constructive proofs of succinct weak circuit lower bounds

Autori: Moritz Müller, Ján Pich
Pubblicato in: Annals of Pure and Applied Logic, Numero 171/2, 2020, Pagina/e 102735, ISSN 0168-0072
Editore: Elsevier BV
DOI: 10.1016/j.apal.2019.102735

Clique is hard on average for regular resolution

Autori: Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander Razborov
Pubblicato in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018, 2018, Pagina/e 866-877, ISBN 9781450355599
Editore: ACM Press
DOI: 10.1145/3188745.3188856

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

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

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

Autori: Albert Atserias, Joanna Ochremiak
Pubblicato in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018, Pagina/e 66-75, ISBN 9781450355834
Editore: ACM
DOI: 10.1145/3209108.3209186

Feasible Interpolation for Polynomial Calculus and Sums-Of-Squares

Autori: Tuomas Hakoniemi
Pubblicato in: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), 2020
Editore: 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

Autori: Yijia Chen, Moritz Müller, Keita Yokoyama
Pubblicato in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018, Pagina/e 235-244, ISBN 9781450355834
Editore: ACM
DOI: 10.1145/3209108.3209155

Resolution Lower Bounds for Refutation Statements

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

Generalized Satisfiability Problems via Operator Assignments

Autori: Albert Atserias, Phokion G. Kolaitis, Simone Severini
Pubblicato in: 21st International Symposium, FCT 2017, Numero Lecture Notes in Computer Science 10472, 2017, Pagina/e 56-68, ISBN 978-3-662-55750-1
Editore: 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

Autori: Massimo Lauria, Jakob Nordstrom
Pubblicato in: 32nd Computational Complexity Conference (CCC 2017), Numero 79, 2017, Pagina/e 2:1--2:20, ISBN 978-3-95977-040-8
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.CCC.2017.2

Entropy Bounds for Conjunctive Queries with Functional Dependencies

Autori: Tomasz Gogacz, Szymon Torunczyk
Pubblicato in: 20th International Conference on Database Theory (ICDT 2017), Numero LIPIcs 68, 2017, Pagina/e 15:1--15:17
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICDT.2017.15

Proof Complexity Meets Algebra

Autori: Albert Atserias, Joanna Ochremiak
Pubblicato in: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Numero 80, 2017, Pagina/e 110:1--110:14, ISBN 978-3-95977-041-5
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2017.110

Derandomizing Isolation in Space-Bounded Settings

Autori: Dieter van Melkebeek, Gautam Prakriya
Pubblicato in: 32nd Computational Complexity Conference (CCC 2017), Numero 79, 2017, Pagina/e 5:1--5:32, ISBN 978-3-95977-040-8
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.CCC.2017.5

Non-Homogenizable Classes of Finite Structures

Autori: Albert Atserias, Szymon Torunczyk
Pubblicato in: 25th EACSL Annual Conference on Computer Science Logic, CSL 2016, 2016, Pagina/e 16:16:00, ISBN 978-3-95977-022-4
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.CSL.2016.16

Homomorphism Problems for First-Order Definable Structures

Autori: Bartek Klin, Slawek Lasota, Joanna Ochremiak, Szymon Torunczyk
Pubblicato in: 36th Foundations of Software Technology and Theoretical Computer Science, 2016, Pagina/e 14:15, ISBN 978-3-95977-027-9
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.FSTTCS.2016.14

On the Power of Symmetric Linear Programs

Autori: Albert Atserias, Anuj Dawar, Joanna Ochremiak
Pubblicato in: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019, Pagina/e 1-13, ISBN 978-1-7281-3608-0
Editore: IEEE
DOI: 10.1109/lics.2019.8785792

Automating Resolution is NP-Hard

Autori: Albert Atserias, Moritz Muller
Pubblicato in: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, Pagina/e 498-509, ISBN 978-1-7281-4952-3
Editore: IEEE
DOI: 10.1109/focs.2019.00038

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

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

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

Autori: Alberto Larrauri, Tobias Müller, Marc Noy
Pubblicato in: 2020
Editore: Cornell University

Circular (Yet Sound) Proofs

Autori: Albert Atserias, Massimo Lauria
Pubblicato in: Theory and Applications of Satisfiability Testing – SAT 2019 - 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9–12, 2019, Proceedings, Numero 11628, 2019, Pagina/e 1-18, ISBN 978-3-030-24257-2
Editore: 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

Autori: Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals
Pubblicato in: Theory and Applications of Satisfiability Testing – SAT 2016, 2016, Pagina/e 160-176, ISBN 978-3-319-40970-2
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-40970-2_11

Pubblicazioni

Condividi questa pagina

Scarica