#### Filter Results:

- Full text PDF available (32)

#### Publication Year

2001

2019

- This year (2)
- Last 5 years (40)
- Last 10 years (62)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Eli Ben-Sasson, Jakob Nordström
- Electronic Colloquium on Computational Complexity
- 2010

For current state-of-the-art DPLL SAT-solvers the two main bottlenecks are the amounts of time and memory used. In proof complexity, these resources correspond to the length and space of resolution… (More)

- Chris Beck, Jakob Nordström, Bangsheng Tang
- STOC
- 2013

We present size-space trade-offs for the polynomial calculus (PC) and polynomial calculus resolution (PCR) proof systems. These are the first true size-space trade-offs in any algebraic proof system,… (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)

- Eli Ben-Sasson, Jakob Nordström
- 49th Annual IEEE Symposium on Foundations of…
- 2008

A number of works have looked at the relationship between length and space of resolution proofs. A notorious question has been whether the existence of a short proof implies the existence of a proof… (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)

- Trinh Huynh, Jakob Nordström
- STOC
- 2012

An active line of research in proof complexity over the last decade has been the study of proof space and trade-offs between size and space. Such questions were originally motivated by practical SAT… (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)

- Jakob Nordström
- SIAM J. Comput.
- 2009

The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of memory cells used if the proof is only allowed to resolve… (More)

Boolean satisfiability (SAT) solvers have improved enormously in performance over the last 10---15 years and are today an indispensable tool for solving a wide range of computational problems.… (More)

- Eli Ben-Sasson, Jakob Nordström
- Computational Complexity of Discrete Problems
- 2008

For current state-of-the-art satisfiability algorithms ba sed on the DPLL procedure and clause learning, the two main bottlenecks are the amounts of time and memory used. Understanding time and… (More)