BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Canada
1 × Latvia
1 × Switzerland
3 × USA
Collaborated with:
M.Miksa T.Huynh A.A.Razborov J.Håstad C.Beck B.Tang Y.Filmus M.Lauria M.Vinyals
Talks about:
proof (5) space (4) resolut (3) complex (3) trade (3) separ (3) off (3) polynomi (2) calculus (2) toward (2)

Person: Jakob Nordström

DBLP DBLP: Nordstr=ouml=m:Jakob

Contributed to:

SAT 20142014
ICALP (1) 20132013
STOC 20132013
STOC 20122012
ICALP (1) 20112011
STOC 20082008
STOC 20062006

Wrote 8 papers:

SAT-2014-MiksaN #proving
Long Proofs of (Seemingly) Simple Formulas (MM, JN), pp. 121–137.
SAT-2014-Nordstrom #complexity #overview #proving #satisfiability
A (Biased) Proof Complexity Survey for SAT Practitioners (JN), pp. 1–6.
ICALP-v1-2013-FilmusLMNV #bound #calculus #comprehension #polynomial #towards
Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds — (YF, ML, MM, JN, MV), pp. 437–448.
STOC-2013-BeckNT #calculus #polynomial #trade-off
Some trade-off results for polynomial calculus: extended abstract (CB, JN, BT), pp. 813–822.
STOC-2012-HuynhN #communication #complexity #on the #proving #trade-off
On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity (TH, JN), pp. 233–248.
ICALP-v1-2011-NordstromR #on the #satisfiability #trade-off
On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution (JN, AAR), pp. 642–653.
STOC-2008-NordstromH #towards
Towards an optimal separation of space and length in resolution (JN, JH), pp. 701–710.
STOC-2006-Nordstrom #proving
Narrow proofs may be spacious: separating space and width in resolution (JN), pp. 507–516.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.