Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions
- E. Ben-Sasson, Jakob Nordström
- Mathematics, Computer Science
- ICS
- 10 August 2010
TLDR
On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity
- Trinh Huynh, Jakob Nordström
- Mathematics, Computer Science
- STOC '12
- 19 May 2012
TLDR
Some trade-off results for polynomial calculus: extended abstract
- C. Beck, Jakob Nordström, Bangsheng Tang
- Mathematics, Computer Science
- STOC '13
- 1 June 2013
TLDR
Pebble Games, Proof Complexity, and Time-Space Trade-offs
- Jakob Nordström
- Computer Science
- Log. Methods Comput. Sci.
- 13 September 2013
TLDR
Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract)
- Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals
- Mathematics, Computer Science
- ICALP
- 8 July 2013
TLDR
Space Complexity in Polynomial Calculus
- Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, N. Thapen
- Mathematics, Computer Science
- SIAM J. Comput.
- 26 August 2015
TLDR
Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution
- E. Ben-Sasson, Jakob Nordström
- Mathematics, Computer Science
- 49th Annual IEEE Symposium on Foundations of…
- 25 October 2008
TLDR
On the interplay between proof complexity and SAT solving
- Jakob Nordström
- Mathematics, Computer Science
- SIGL
- 17 August 2015
TLDR
Relating Proof Complexity Measures and Practical Hardness of SAT
- Matti Järvisalo, A. Matsliah, Jakob Nordström, Stanislav Zivny
- Computer Science
- CP
- 8 October 2012
TLDR
A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds
- Mladen Miksa, Jakob Nordström
- Mathematics, Computer Science
- Computational Complexity Conference
- 6 May 2015
TLDR