#### Filter Results:

- Full text PDF available (20)

#### Publication Year

2005

2018

- This year (0)
- Last 5 years (32)
- Last 10 years (52)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen
- SIAM J. Comput.
- 2015

During the last 10 to 15 years, an active line of research in proof complexity has been to study space complexity and time-space trade-offs for proofs. Besides being a natural complexity measure of… (More)

- Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals
- ICALP
- 2013

During the last decade, an active line of research in proof complexity has been into the space complexity of proofs and how space is related to other measures. By now these aspects of resolution are… (More)

- Albert Atserias, Massimo Lauria, Jakob Nordström
- IEEE Conference on Computational Complexity
- 2014

We prove that there are 3-CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size nW(w). This shows that the simple counting argument that any… (More)

A general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [9]. There the authors concentrate on tree-like Parameterized Resolution--a parameterized… (More)

- Olaf Beyersdorff, Nicola Galesi, Massimo Lauria
- SAT
- 2011

We study the performance of DPLL algorithms on parameterized problems. In particular, we investigate how difficult it is to decide whether small solutions exist for satisfiability and other… (More)

- Yuval Filmus, Pavel Hrubes, Massimo Lauria
- STACS
- 2016

In this paper, we compare the strength of the semantic and syntactic version of the cutting planes proof system.
First, we show that the lower bound technique of Pudlak applies also to semantic… (More)

- Nicola Galesi, Massimo Lauria
- ACM Trans. Comput. Log.
- 2010

There are methods to turn short refutations in <i>polynomial calculus</i> (Pc) and <i>polynomial calculus with resolution</i> (Pcr) into refutations of low degree. Bonet and Galesi [1999, 2003] asked… (More)

- Nicola Galesi, Massimo Lauria
- Theory of Computing Systems
- 2009

We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error randomized algorithms. This… (More)

- Olaf Beyersdorff, Nicola Galesi, Massimo Lauria
- Circuits, Logic, and Games
- 2010

Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dantchev et al. show a… (More)

The d-Dim h-hops MST problem is defined as follows: Given a set S of points in the d-dimensional Euclidean space and s ∈ S, find a minimum-cost spanning tree for S rooted at s with height at most h.… (More)