#### Filter Results:

- Full text PDF available (32)

#### Publication Year

1970

2017

- This year (3)
- Last 5 years (28)
- Last 10 years (43)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Eli Ben-Sasson, Jakob Nordström
- ICS
- 2010

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

- Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, Noga Ron-Zewi
- 2012 IEEE 27th Conference on Computational…
- 2012

During the last decade, 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 intrinsic… (More)

- Jakob Nordström
- Logical Methods in Computer Science
- 2013

Pebble games were extensively studied in the 1970s and 1980s in a number of different contexts. The last decade has seen a revival of interest in pebble games coming from the field of proof… (More)

- Eli Ben-Sasson, Jakob Nordström
- 2008 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)

- Jakob Nordström
- 1970

Pebble games were extensively studied in the 1970s and 1980s in a number of different contexts. The last decade has seen renewed interest in pebbling in the field of proof complexity. This is a… (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)

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

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

- Jakob Nordström
- STOC
- 2005

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 clauses kept in memory simultaneously if the proof is only… (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)

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. However,… (More)