Mathematical Insights into Algorithms for Optimization (MIAO) Group
Latest News
We need to hire both PhD students and postdocs to rebuild
the research group after the move to Copenhagen and Lund!
Currently, there are openings for
PhD students in
theoretical
computer science and/or combinatorial optimization
in Lund, with an application deadline of
July 5, 2021..
More announcements are on the way.
Please feel free to
drop a line
to Jakob Nordström
if you are interested.
That 2020 has been a thrilling year is somewhat of an
understatement, but for the MIAO group the first academic year at
the University of Copenhagen and Lund University has been filled
with excitement for all the right reasons!
Our works on designing state-of-the-art algorithms for combinatorial
optimization problems, and making sure not only that such algorithms
run fast but that we also understand how they perform and can prove
that they produce correct results, have appeared in the premier AI
conferences AAAI and IJCAI (3 papers), as well as
in more specialized high-profile conferences on combinatorial
optimization such as CP,CPAIOR, and SAT
(6 papers), and on formal verification such as CAV
and FMCAD (2 papers). On the flip side, research
contributions focusing on understanding the limitations of such
optimization algorithms, or of efficient computation in general,
from a rigorous, mathematical point of view have been accepted to
top theoretical computer science conferences such
as STOC,FOCS,CCC, and ITCS
(5 papers).
After this veritable explosion of 16 conference papers during 2020
(not counting journal papers and technical reports), we are not
quite sure what to expect going forward, but so far it sure seems
like the MIAO kitten is indeed enjoying life in the company of the
big, friendly BARC dog…
Briefly About the MIAO Research Group
The Mathematical Insights into Algorithms for Optimization (MIAO)
research group is based on both sides of the Öresund Bridge at
Lund University
and the
University of Copenhagen
(where we are friendly neighbours with
BARC).
The MIAO research group has a fairly unusual profile in that we are
doing cutting-edge research both on deeply theoretical, mathematical
problems concerning the foundations of efficient computations and on
the design of state-of-the-art applied algorithms that are meant to
run blisteringly fast in practice.
Much of the activities of the group revolve around powerful
algorithmic paradigms such as, e.g., Boolean satisfiability (SAT)
solving, Gröbner basis computations, integer linear
programming, constraint programming, and semidefinite
programming. This leads to classic questions in computational
complexity theory — though often with new, interesting twists
— but also involves work on devising new algorithmic
approaches that can exploit the power of such paradigms in practice.
On the theory side, most of our work has been in proof complexity,
i.e., the study of formal systems for reasoning about logic formulas
and other types of problems from the point of view of computational
complexity. Proof complexity has connections to foundational
questions in computational complexity theory, but another important
motivation is algorithm analysis. All algorithms use some kind of
method of reasoning to compute solutions to problems, and proof
complexity can be used to analyse the potential and limitations of
such methods (and thereby of the algorithms using them).
As often happens in theoretical computer science, our research in
proof complexity has revealed deep, and often quite surprising,
connections to other areas such as, e.g., circuit complexity,
communication complexity, hardness of approximation, and finite
model theory, and so we are also interested in such areas.
On the practical side, we want to gain a more rigorous scientific
understanding, and improve the performance, of state-of-the-art
solvers for combinatorial optimization problems. We are
particularly interested in harnessing powerful mathematical tools
such as Gröbner bases or 0-1 integer linear programming (also known
as pseudo-Boolean solving) to achieve exponential improvements in
performance, which seems possible in theory but has so far been hard
to achieve in practice.
Our most active line of work right now is focusing on
combining ideas from SAT solving and mixed integer linear
programming (MIP) to construct a new 0-1 integer linear programming
solver
RoundingSat. This solver is already state of the art in pseudo-Boolean solving,
but our goal is to develop it further, integrating ideas also from
MaxSAT solving, MIP solving,
satisfiability modulo theories (SMT) solving,
and constraint programming (CP), ultimately hoping to go
significantly beyond the current state of the art.
Quite
recently, we have begun investigating how to verify the
correctness of state-of-the-art algorithms for combinatorial
optimization. Such algorithms are often highly complex, and even
mature commercial solvers are known to sometimes produce wrong
results. What we are working on is to redesign state-of-the-art
combinatorial solvers to make them certifying, i.e., so that
they output not only a solution but also a simple, machine-verifiable
proof that the claimed solution is correct and complete—this is also
known as proof logging.
For such a certifying solver, the workflow becomes as follows:
Run the solver on a problem instance to obtain not only a
solution, but also a proof of correctness.
Feed the problem, the solution, and the proof to a special,
dedicated proof checker for verification.
Accept the solution if the proof checker says that the proof is valid.
Importantly, these machine-verifiable proofs should be very easy to
generate and should require low overhead on the solver side, but should
also be very easy to check efficiently on the proof checker side,
and should still provide 100% formal guarantees of correctness.
Our research in this area is still very much work in progress, but
our tool
VeriPB
can already provide efficient proof logging for some
solving techniques that have long remained beyond the reach of other tools.
Chris Beck,
Princeton University,
January-February 2012
Trinh Huynh,
University of Washington and ETH Zurich,
August-September 2011
Short-Term Visitors
(Visitors since August 2019 received in Copenhagen and/or Lund.
All visits planned for 2020 were cancelled due to
the Covid-19 pandemic. We are eagerly waiting for conditions to
change so that our vibrant exchange of visitors can resume.)
Daniela Kaufmann,
Johannes Kepler Universität Linz,
November 2019
Vincent Liew,
University of Washington,
November 2019
Satisfiability:
Theory, Practice, and Beyond,
semester program at the Simons Institute for the Theory of
Computing at UC Berkeley, January-May 2021.
[Converted to virtual format due to the Covid-19 pandemic.]
Below follows a list of publications, sorted in reverse chronological
order, emanating from the MIAO research group. As a general rule,
these papers are copyright by their respective publishers but are free
for personal use.
Please note that the list below is updated at somewhat irregular
intervals. The last proper update was in March 2021.
See
www.csc.kth.se/~jakobn/research/
for a full list of Jakob Nordström's publications
(which is updated much more frequently, but does not contain papers by other
members of the group on which Jakob Nordström is not a co-author).
2021
Susanna F. de Rezende, Mika Göös, Jakob Nordström,
Toniann Pitassi, Robert Robere, and Dmitry Sokolov.
Automating Algebraic Proof Systems is NP-Hard.
To appear in
Proceedings of the 53rd Annual ACM Symposium on Theory of Computing
(STOC '21),
June 2021.
Mladen Mikša and Jakob Nordström.
A Generalized Method for Proving
Polynomial Calculus Degree Lower Bounds.
To appear in
Journal of the ACM,
2021.
Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria,
Jakob Nordström, and Alexander Razborov.
Clique Is Hard on Average for Regular Resolution.
To appear in
Journal of the ACM, 2021.
Jo Devriendt, Stephan Gocht, Emir Demirović,
Jakob Nordström, and Peter Stuckey.
Cutting to the Core of Pseudo-Boolean Optimization:
Combining Core-Guided Search with Cutting Planes Reasoning.
To appear in
Proceedings of the
35th AAAI Conference on Artificial Intelligence (AAAI '21),
February 2021.
Stephan Gocht and Jakob Nordström.
Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs.
To appear in
Proceedings of the
35th AAAI Conference on Artificial Intelligence (AAAI '21),
February 2021.
Sam Buss and Jakob Nordström.
Proof Complexity and SAT Solving.
In
Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh (editors),
Handbook of Satisfiability, 2nd edition,
Chapter 7, pages 233-350. IOS Press, 2021.
Susanna F. de Rezende, Or Meir, Jakob Nordström, and Robert Robere.
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling.
Computational Complexity,
February 2021.
Jo Devriendt, Ambros Gleixner, and Jakob Nordström.
Learn to Relax: Integrating 0-1 Integer Linear Programming
with Conflict-Driven Pseudo-Boolean Search.
Constraints,
January 2021.
(Special issue for CPAIOR '20.)
Susanna F. de Rezende, Jakob Nordström, and Marc Vinyals.
How Limited Interaction Hinders Real Communication
(and What It Means for Proof and Circuit Complexity).
Technical Report TR21-006,
Electronic Colloquium on Computational Complexity (ECCC),
January 2021.
2020
Susanna F. de Rezende, Or Meir, Jakob Nordström,
Toniann Pitassi, Robert Robere, and Marc Vinyals.
Lifting with Simple Gadgets and Applications to
Circuit and Proof Complexity.
In
Proceedings of the 61st Annual IEEE Symposium on
Foundations of Computer Science (FOCS '20),
pages 24-30, November 2020.
Susanna F. de Rezende, Or Meir, Jakob Nordström,
Toniann Pitassi, and Robert Robere.
KRW Composition Theorems via Lifting.
In
Proceedings of the 61st Annual IEEE Symposium on
Foundations of Computer Science (FOCS '20),
pages 43-49, November 2020.
Vincent Liew, Paul Beame, Jo Devriendt, Jan Elffers, and Jakob Nordström.
Verifying Properties of Bit-vector Multiplication
Using Cutting Planes Reasoning.
In
Proceedings of the 20th Conference on
Formal Methods in Computer-Aided Design (FMCAD '20),
pages 194-204, September 2020.
Jo Devriendt, Ambros Gleixner, and Jakob Nordström.
Learn to Relax: Integrating 0-1 Integer Linear Programming
with Conflict-Driven Pseudo-Boolean Search.
In
Proceedings of the 17th International Conference on the
Integration of Constraint Programming, Artificial Intelligence,
and Operations Research (CPAIOR '20),
pages xxiv-xxv, September 2020.
Stephan Gocht, Ciaran McCreesh and Jakob Nordström.
VeriPB: The Easy Way to Make Your
Combinatorial Search Algorithm Trustworthy.
From Constraint Programming to Trustworthy AI,
workshop at the
26th International Conference
on Principles and Practice of Constraint Programming (CP '20),
September 2020.
(See also the
video
from the workshop.)
Jo Devriendt.
Watched Propagation of 0-1 Integer Linear Constraints.
In
Proceedings of the 26th International Conference on
Principles and Practice of Constraint Programming (CP '20),
Lecture Notes in Computer Science, volume 12333,
pages 160-176, September 2020.
Stephan Gocht, Ross McBride, Ciaran McCreesh,
Jakob Nordström, Patrick Prosser, and James Trimble.
Certifying Solvers for Clique and Maximum
Common (Connected) Subgraph Problems.
In
Proceedings of the 26th International Conference on
Principles and Practice of Constraint Programming (CP '20),
Lecture Notes in Computer Science, volume 12333,
pages 338-357, September 2020.
Janne I. Kokkala and Jakob Nordström.
Using Resolution Proofs to Analyse CDCL Solvers.
In
Proceedings of the 26th International Conference on
Principles and Practice of Constraint Programming (CP '20),
Lecture Notes in Computer Science, volume 12333,
pages 427-444, September 2020.
Buser Say, Jo Devriendt, Jakob Nordström, and Peter Stuckey.
Theoretical and Experimental Results for Planning with Learned
Binarized Neural Network Transition Models.
In
Proceedings of the 26th International Conference on
Principles and Practice of Constraint Programming (CP '20),
Lecture Notes in Computer Science, volume 12333,
pages 917-934, September 2020.
Susanna F. de Rezende, Jakob Nordström,
Kilian Risse, and Dmitry Sokolov.
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and
Perfect Matching Formulas over Sparse Graphs.
In
Proceedings of the 35th Annual Computational Complexity Conference (CCC '20),
Leibniz International Proceedings in Informatics (LIPIcs),
volume 169, pages 28:1-28:24,
July 2020.
Mate Soos, Stephan Gocht, and Kuldeep S. Meel.
Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications
to Counting and Sampling.
In
Proceedings of the 32nd International Conference on
Computer Aided Verification (CAV '20), Part I,
Lecture Notes in Computer Science, volume 12224, pages 463-484,
July 2020.
Dmitry Sokolov.
(Semi)Algebraic Proofs over {±1}Variables.
In
Proceedings of the 52nd Annual ACM Symposium on Theory of Computing
(STOC '20),
pages 78-90, June 2020.
Marc Vinyals, Jan Elffers, Jan Johannsen, and Jakob Nordström.
Simplified and Improved Separations Between Regular and General Resolution by Lifting.
In
Proceedings of the 23rd International Conference on
Theory and Applications of Satisfiability Testing (SAT '20),
Lecture Notes in Computer Science, volume 12178,
pages 182-200, July 2020.
Stephan Gocht, Ciaran McCreesh, and Jakob Nordström.
Subgraph Isomorphism Meets Cutting Planes:
Solving with Certified Solutions.
In
Proceedings of the 29th International Joint Conference on
Artificial Intelligence (IJCAI '20),
pages 1134-1140,
July 2020.
Christoph Berkholz and Jakob Nordström.
Supercritical Space-Width Trade-offs for Resolution.SIAM Journal on Computing,
volume 49, issue 1, pages 98-118, February 2020.
Jan Elffers, Stephan Gocht, Ciaran McCreesh, and Jakob Nordström.
Justifying All Differences Using Pseudo-Boolean Reasoning.
In
Proceedings of the
34th AAAI Conference on Artificial Intelligence (AAAI '20),
pages 1486-1494,
February 2020.
Jan Elffers and Jakob Nordström.
A Cardinal Improvement to Pseudo-Boolean Solving.
In
Proceedings of the
34th AAAI Conference on Artificial Intelligence (AAAI '20),
pages 1495-1503,
February 2020.
Guillaume Lagarde, Jakob Nordström, Dmitry Sokolov, and Joseph Swernofsky.
Trade-offs Between Size and Degree in Polynomial Calculus.
In
Proceedings of the 11th Innovations in
Theoretical Computer Science Conference (ITCS '20),
Leibniz International Proceedings in Informatics (LIPIcs),
volume 151, pages 72:1-72:16,
January 2020.
2019
Bernhard Beckert, Thorsten Bormer, Stephan Gocht, Mihai Herda, Daniel Lentzsch, and Mattias Ulbrich.
Using Relational Verification for Program Slicing.
In
Proceedings of the 17th International Conference on
Software Engineering and Formal Methods
(SEFM '19),
Lecture Notes in Computer Science, volume 11724, pages 353-372,
September 2019.
Stephan Gocht, Jakob Nordström, and Amir Yehudayoff.
On Division Versus Saturation in Pseudo-Boolean Solving.
In
Proceedings of the 28th International Joint Conference on
Artificial Intelligence (IJCAI '19),
pages 1711-1718,
August 2019.
Susanna F. de Rezende,
Jakob Nordström,
Or Meir,
and Robert Robere.
Nullstellensatz Size-Degree Trade-offs from
Reversible Pebbling.
In
Proceedings of the 34th Annual Computational Complexity Conference (CCC '19),
Leibniz International Proceedings in Informatics (LIPIcs),
volume 137, pages 18:1-18:26,
July 2019.
Tu-San Pham, Jo Devriendt, and Patrick De Causmaecker.
Declarative Local Search for Predicate Logic.
In
Proceedings of the 15th
International Conference on Logic Programming and
Nonmonotonic Reasoning
(LPNMR '19),
pages 340-346, June 2019.
Marjolein Deryck, Joost Vennekens, Jo Devriendt, and Simon Marynissen.
Legislation in the Knowledge Base Paradigm: Interactive Decision
Enactment for Registration Duties.
In
Proceedings of the 13th International Conference on
Semantic Computing (ICSC '19),
pages 174-177, January-February 2019.
Mika Göös, Pritish Kamath, Robert Robere, and Dmitry Sokolov.
Adventures in Monotone Complexity and TFNP.
In
Proceedings of the 10th Innovations in
Theoretical Computer Science Conference (ITCS '19),
Leibniz International Proceedings in Informatics (LIPIcs),
volume 124, pages 38:1-38:19,
January 2019.
2018
Jan Elffers and Jakob Nordström.
Divide and Conquer: Towards Faster Pseudo-Boolean Solving.
In
Proceedings of the 27th International Joint Conference on
Artificial Intelligence (IJCAI '18),
pages 1291-1299, July 2018.
Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström, and
Laurent Simon.
Seeking Practical CDCL Insights from Theoretical SAT Benchmarks.
In
Proceedings of the 27th International Joint Conference on
Artificial Intelligence (IJCAI '18),
pages 1300-1308, July 2018.
Jan Elffers, Jesús Giráldez-Cru, Jakob Nordström, and Marc Vinyals.
Using Combinatorial Benchmarks to Probe the Reasoning Power of
Pseudo-Boolean Solvers.
In
Proceedings of the 21st International Conference on
Theory and Applications of Satisfiability Testing (SAT '18),
Lecture Notes in Computer Science, volume 10929,
pages 75-93, July 2018.
Marc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, and Jakob Nordström.
In Between Resolution and Cutting Planes: A Study of Proof Systems
for Pseudo-Boolean SAT Solving.
In
Proceedings of the 21st International Conference on
Theory and Applications of Satisfiability Testing (SAT '18),
Lecture Notes in Computer Science, volume 10929,
pages 292-310, July 2018.
Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria,
Jakob Nordström, and Alexander Razborov.
Clique Is Hard on Average for Regular Resolution.
In
Proceedings of the 50th Annual ACM Symposium on Theory of Computing
(STOC '18),
pages 866-877, June 2018.
Ankit Garg, Mika Göös, Pritish Kamath, and Dmitry Sokolov.
Monotone circuit lower bounds from resolution.
In
Proceedings of the 50th Annual ACM Symposium on Theory of Computing
(STOC '18),
pages 902-911, June 2018.
Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, and Sagnik Mukhopadhyay.
Simulation Beats Richness: New Data-Structure Lower Bounds.
In
Proceedings of the 50th Annual ACM Symposium on Theory of Computing
(STOC '18),
pages 1013-1020, June 2018.
Sam Buss, Dmitry Itsykson, Alexander Knop, and Dmitry Sokolov.
Reordering Rule Makes OBDD Proof Systems Stronger.
In
Proceedings of the 33rd Annual Computational Complexity Conference
(CCC '17),
Leibniz International Proceedings in Informatics (LIPIcs),
volume 102, pages 16:1-16:24, June 2018.
2017
Ilario Bonacina.
Space in Weak Propositional Proof Systems.
Springer, 2017.
Massimo Lauria and Jakob Nordström.
Tight Size-Degree Bounds for Sums-of-Squares Proofs.Computational Complexity,
volume 26, issue 3, pages 911-948, December 2017.
Ilario Bonacina and Navid Talebanfard.
Strong ETH and Resolution via Games and the Multiplicity of Strategies.Algorithmica,
volume 79, issue 1, pages 29-41, September 2017.
Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, and Jordi Levy.
Structure Features for SAT Instances ClassificationJournal of Applied Logic,
volume 23, pages 27-39, September 2017.
Jesús Giráldez-Cru and Jordi Levy.
Locality in Random SAT Instances.
In
Proceedings of the 26th International Joint Conference on
Artificial Intelligence (IJCAI '17),
pages 638-644, August 2017.
Massimo Lauria, Jan Elffers, Jakob Nordström, and Marc Vinyals.
CNFgen: A Generator of Crafted Benchmarks.
In
Proceedings of the 20th International Conference on
Theory and Applications of Satisfiability Testing (SAT '17),
Lecture Notes in Computer Science, volume 10491,
pages 464-473, August 2017.
Guillaume Baud-Berthier, Jesús Giráldez-Cru, and Laurent Simon.
On the Community Structure of Bounded Model Checking SAT Problems.
In
Proceedings of the 20th International Conference on
Theory and Applications of Satisfiability Testing (SAT '17),
Lecture Notes in Computer Science, volume 10491,
pages 65-82, August 2017.
Patrick Bennett, Ilario Bonacina, Nicola Galesi,
Tony Huynh, Mike Molloy, and Paul Wollan.
Space proof complexity for random 3-CNFs.Information and Computation,
volume 255, part 1, pages 165-176, August 2017.
Massimo Lauria and Jakob Nordström.
Graph Colouring is Hard for Algorithms Based on
Hilbert's Nullstellensatz and Gröbner Bases.
In
Proceedings of the 32nd Annual Computational Complexity Conference (CCC '17),
Leibniz International Proceedings in Informatics (LIPIcs),
volume 79, pages 2:1-2:20,
July 2017.
Massimo Lauria, Pavel Pudlák,
Vojtěch Rödl and Neil Thapen.
The Complexity of Proving That a Graph Is Ramsey.Combinatorica,
volume 37, issue 2, pages 253-268,
April 2017.
Joël Alwen, Susanna F. de Rezende, Jakob Nordström, and Marc Vinyals.
Cumulative Space in Black-White Pebbling and Resolution.
In
Proceedings of the 8th Innovations in
Theoretical Computer Science Conference (ITCS '17),
Leibniz International Proceedings in Informatics (LIPIcs),
volume 67, pages 38:1-38:21,
January 2017.
2016
Susanna F. de Rezende, Jakob Nordström, and Marc Vinyals.
How Limited Interaction Hinders Real Communication
(and What It Means for Proof and Circuit Complexity).
In
Proceedings of the 57th Annual IEEE Symposium on
Foundations of Computer Science (FOCS '16),
pages 295-304, October 2016.
Ilario Bonacina, Nicola Galesi, and Neil Thapen.
Total Space in Resolution.SIAM Journal on Computing,
volume 45, issue 5, pages 1894-1909, October 2016.
Christoph Berkholz and Jakob Nordström.
Near-Optimal Lower Bounds on Quantifier Depth and
Weisfeiler-Leman Refinement Steps.
Technical Report TR16-135,
Electronic Colloquium on Computational Complexity (ECCC),
August 2016.
Christoph Berkholz and Jakob Nordström.
Supercritical Space-Width Trade-offs for Resolution.
In
Proceedings of the 43rd International Colloquium on
Automata, Languages and Programming (ICALP '16),
Leibniz International Proceedings in Informatics (LIPIcs),
volume 55, pages 57:1-57:14, July 2016.
Ilario Bonacina.
Total Space in Resolution Is at Least Width Squared.
In
Proceedings of the 43rd International Colloquium on
Automata, Languages and Programming (ICALP '16),
Leibniz International Proceedings in Informatics (LIPIcs),
volume 55, pages 56:1-56:13, July 2016.
Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard,
Jakob Nordström, and Marc Vinyals.
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers.
In
Proceedings of the 19th International Conference on
Theory and Applications of Satisfiability Testing (SAT '16),
Lecture Notes in Computer Science, volume 9710,
pages 160-176, July 2016.
Christoph Berkholz and Jakob Nordström.
Near-Optimal Lower Bounds on Quantifier Depth and
Weisfeiler-Leman Refinement Steps.
In
Proceedings of the 31st Annual ACM/IEEE Symposium on
Logic in Computer Science (LICS '16),
July 2016.
Massimo Lauria.
A Rank Lower Bound for Cutting Planes Proofs of
Ramsey's Theorem.ACM Transactions on Computation Theory,
volume 8, issue 4, article 17, June 2016.
Albert Atserias, Massimo Lauria, and Jakob Nordström.
Narrow Proofs May Be Maximally Long.
In
ACM Transactions on Computational Logic,
volume 17, issue 3, article 19, May 2016.
Yuval Filmus, Pavel Hrubeš, and Massimo Lauria.
Semantic Versus Syntactic Cutting Planes.
In
Proceedings of the 33rd Symposium on Theoretical Aspects of
Computer Science (STACS '16),
pages 35:1-35:13, February 2016.
Ilario Bonacina and Navid Talebanfard.
Improving Resolution Width Lower Bounds for k-CNFs with Applications to the
Strong Exponential Time Hypothesis.Information Processing Letters,
volume 116, issue 2, pages 120-124, February 2016.
Olaf Beyersdorff, Ilario Bonacina, and Leroy Chew.
Lower Bounds: From Circuits to QBF Proof Systems.
In
Proceedings of the 7th Innovations in
Theoretical Computer Science Conference (ITCS '16),
pages 249-260, January 2016.
2015
Siu Man Chan, Massimo Lauria, Jakob Nordström, and Marc Vinyals.
Hardness of Approximation in PSPACE and Separation
Results for Pebble Games (Extended Abstract).
In
Proceedings of the 56th Annual IEEE Symposium on
Foundations of Computer Science (FOCS '15),
pages 466-485,
October 2015.
Ilario Bonacina and Navid Talebanfard.
Strong ETH and Resolution via Games and the Multiplicity of Strategies.
In
Proceedings of the 10th International Symposium on Parameterized and
Exact Computation (IPEC '15),
Leibniz International Proceedings in Informatics (LIPIcs),
volume 43, pages 248-257, September 2015.
Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, and Neil Thapen.
Space Complexity in Polynomial Calculus.SIAM Journal on Computing,
volume 44, issue 4, pages 1119-1153, August 2015.
Yuval Filmus, Massimo Lauria, Mladen Mikša, Jakob Nordström, and Marc Vinyals.
From Small Space to Small Width in Resolution.ACM Transactions on Computational Logic,
volume 16, issue 4, article 28, July 2015.
Jakob Nordström.
On the Interplay Between Proof Complexity and SAT Solving.ACM SIGLOG News,
volume 2, number 3, pages 19-44, July 2015.
(Lightly edited version with some typos fixed.)
Massimo Lauria and Jakob Nordström.
Tight Size-Degree Bounds for Sums-of-Squares Proofs.
In
Proceedings of the 30th Annual
Computational Complexity Conference (CCC '15),
Leibniz International Proceedings in Informatics (LIPIcs),
volume 33, pages 448-466,
June 2015.
Mladen Mikša and Jakob Nordström.
A Generalized Method for Proving
Polynomial Calculus Degree Lower Bounds.
In
Proceedings of the 30th Annual
Computational Complexity Conference (CCC '15),
Leibniz International Proceedings in Informatics (LIPIcs),
volume 33, pages 467-487,
June 2015.
2014
Jakob Nordström.
A (Biased) Proof Complexity Survey for SAT Practitioners.
In
Proceedings of the 17th International Conference on
Theory and Applications of Satisfiability Testing (SAT '14),
Lecture Notes in Computer Science, volume 8561,
pages 1-6, July 2014.
Mladen Mikša and Jakob Nordström.
Long Proofs of (Seemingly) Simple Formulas.
In
Proceedings of the 17th International Conference on
Theory and Applications of Satisfiability Testing (SAT '14),
Lecture Notes in Computer Science, volume 8561,
pages 121-137, July 2014.
Albert Atserias, Massimo Lauria, and Jakob Nordström.
Narrow Proofs May Be Maximally Long (Extended Abstract).
In
Proceedings of the 29th Annual IEEE Conference on Computational Complexity (CCC '14),
pages 286-297, June 2014.
Yuval Filmus, Massimo Lauria, Mladen Mikša, Jakob Nordström, and Marc Vinyals.
From Small Space to Small Width in Resolution.
In
Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science
(STACS '14),
pages 300-311, March 2014.
2013
Jakob Nordström.
Pebble Games, Proof Complexity, and Time-Space Trade-offs.Logical Methods in Computer Science,
volume 9, issue 3, article 15, September 2013.
Olaf Beyersdorff, Nicola Galesi, and Massimo Lauria. A Characterization
of Tree-Like Resolution Size. In Information Processing Letters,
volume 113, number 18,
pages 666-671, September 2013.
Olaf Beyersdorff, Nicola Galesi, and Massimo Lauria. Parameterized
Complexity of DPLL Search Procedures In ACM Transactions on
Computational Logic,
volume 14, issue 3, article 23,
August 2013.
Massimo Lauria. A Rank Lower Bound for Cutting Planes Proofs of
Ramsey Theorem. In Proceedings of the 16th International
Conference on Theory and Applications of Satisfiability Testing (SAT '13),
pages 351-364, July 2013.
Yuval Filmus, Massimo Lauria, Mladen Mikša, Jakob Nordström, and Marc Vinyals.
Towards an Understanding of Polynomial Calculus: New Separations and
Lower Bounds (Extended Abstract).
In
Proceedings of the 40th International Colloquium on
Automata, Languages and Programming (ICALP '13),
Lecture Notes in Computer Science, volume 7965,
pages 437-448, July 2013.
Massimo Lauria, Pavel Pudlak, Vojtěch Rödl, and Neil Thapen. The
Complexity of Proving That a Graph Is Ramsey. In Proceedings of
the 40th International Colloquium on Automata, Languages and
Programming (ICALP '13),
Lecture Notes in Computer Science, volume 7965,
pages 684-695, July 2013.
Chris Beck, Jakob Nordström, and Bangsheng Tang.
Some Trade-off Results for Polynomial Calculus (Extended Abstract).
In
Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC '13),
pages 813-822,
June 2013.
Jakob Nordström and Johan Håstad.
Towards an Optimal Separation of Space and Length in Resolution.Theory of Computing,
volume 9, article 14, pages 471-557, May 2013.
2012
Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, and Neil Thapen.
Space Complexity in Polynomial Calculus.
Technical Report TR12-132,
Electronic Colloquium on Computational Complexity (ECCC),
October 2012.
Matti Järvisalo, Arie Matsliah, Jakob Nordström, and Stanislav Živný.
Relating Proof Complexity Measures and Practical Hardness of SAT.
In
Proceedings of the 18th International Conference on
Principles and Practice of Constraint Programming (CP '12),
pages 316-331, October 2012.
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, and Alexander A.
Razborov. Parameterized Bounded-depth Frege Is Not Optimal. In
ACM Transaction on Computational Theory,
volume 4, issue 3, article 7,
September 2012.
Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, and Noga Ron-Zewi.
Space Complexity in Polynomial Calculus (Extended Abstract).
In
Proceedings of the 27th Annual IEEE Conference on Computational Complexity (CCC '12),
pages 334-344, June 2012.
Trinh Huynh and Jakob Nordström.
On the Virtue of Succinct Proofs:
Amplifying Communication Complexity Hardness to
Time-Space Trade-offs in Proof Complexity (Extended Abstract).
In
Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC '12),
pages 233-248, May 2012.
Jakob Nordström.
On the Relative Strength of Pebbling and Resolution.ACM Transactions on Computational Logic,
volume 13, issue 2, article 16, April 2012.
2011
Jakob Nordström and Alexander Razborov.
On Minimal Unsatisfiability and
Time-Space Trade-offs for k-DNF Resolution.
In
Proceedings of the 38th International Colloquium on
Automata, Languages and Programming (ICALP '11),
Lecture Notes in Computer Science, volume 6755,
pages 642-653, July 2011.
Eli Ben-Sasson and Jakob Nordström.
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions (Extended Abstract).
In
Proceedings of the 2nd Symposium on Innovations in Computer Science (ICS '11),
pages 401-416, January 2011.
På svenska
