default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJakob Nordström
Person information
- affiliation: University of Copenhagen, Denmark
- affiliation: Lund University, Sweden
- affiliation (former): KTH Royal Institute of Technology, Stockholm, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j17]Susanna F. de Rezende
, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere:
KRW Composition Theorems via Lifting. Comput. Complex. 33(1): 4 (2024)- [c63]Stephan Gocht, Ciaran McCreesh, Magnus O. Myreen, Jakob Nordström, Andy Oertel, Yong Kiam Tan:
End-to-End Verification for Subgraph Solving. AAAI 2024: 8038-8047 - [c62]Jeremias Berg, Bart Bogaerts, Jakob Nordström, Andy Oertel, Tobias Paxian, Dieter Vandesande:
Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability. CP 2024: 4:1-4:28 - [c61]Emir Demirovic, Ciaran McCreesh, Matthew J. McIlree, Jakob Nordström, Andy Oertel, Konstantin Sidorov:
Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms. CP 2024: 9:1-9:21 - [c60]Matthew J. McIlree, Ciaran McCreesh, Jakob Nordström:
Proof Logging for the Circuit Constraint. CPAIOR (2) 2024: 38-55 - [c59]Alexander Hoen, Andy Oertel, Ambros M. Gleixner, Jakob Nordström:
Certifying MIP-Based Presolve Reductions for 0-1 Integer Linear Programs. CPAIOR (1) 2024: 310-328 - [c58]Hannes Ihalainen, Andy Oertel, Yong Kiam Tan, Jeremias Berg, Matti Järvisalo, Magnus O. Myreen, Jakob Nordström:
Certified MaxSAT Preprocessing. IJCAR (1) 2024: 396-418 - [i50]Hannes Ihalainen, Andy Oertel, Yong Kiam Tan, Jeremias Berg, Matti Järvisalo, Jakob Nordström:
Certified MaxSAT Preprocessing. CoRR abs/2404.17316 (2024) - 2023
- [j16]Christoph Berkholz, Jakob Nordström:
Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. J. ACM 70(5): 32:1-32:32 (2023) - [j15]Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström:
Certified Dominance and Symmetry Breaking for Combinatorial Optimisation. J. Artif. Intell. Res. 77: 1539-1589 (2023) - [c57]Jeremias Berg, Bart Bogaerts, Jakob Nordström, Andy Oertel, Dieter Vandesande:
Certified Core-Guided MaxSAT Solving. CADE 2023: 1-22 - [c56]Gioni Mexi, Timo Berthold, Ambros M. Gleixner, Jakob Nordström:
Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning. CP 2023: 27:1-27:19 - [c55]Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse:
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz. FOCS 2023: 1-11 - [c54]Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel:
Certified CNF Translations for Pseudo-Boolean Solving (Extended Abstract). IJCAI 2023: 6436-6441 - [i49]Siu Man Chan, Massimo Lauria, Jakob Nordström, Marc Vinyals:
Hardness of Approximation in PSPACE and Separation Results for Pebble Games. CoRR abs/2305.19104 (2023) - [i48]Massimo Lauria, Jakob Nordström:
Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases. CoRR abs/2306.00125 (2023) - [i47]Gioni Mexi, Timo Berthold, Ambros M. Gleixner, Jakob Nordström:
Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning. CoRR abs/2307.14166 (2023) - 2022
- [c53]Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström:
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation. AAAI 2022: 3698-3707 - [c52]Stephan Gocht, Ciaran McCreesh, Jakob Nordström:
An Auditable Constraint Programming Solver. CP 2022: 25:1-25:18 - [c51]Daniela Kaufmann, Paul Beame, Armin Biere, Jakob Nordström:
Adding Dual Variables to Algebraic Reasoning for Gate-Level Multiplier Verification. DATE 2022: 1431-1436 - [c50]Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel:
Certified CNF Translations for Pseudo-Boolean Solving. SAT 2022: 16:1-16:25 - [i46]Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström:
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation. CoRR abs/2203.12275 (2022) - [i45]Stephan Gocht, Jakob Nordström:
Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs. CoRR abs/2209.12185 (2022) - [i44]Olaf Beyersdorff, Armin Biere, Vijay Ganesh, Jakob Nordström, Andy Oertel:
Theory and Practice of SAT and Combinatorial Solving (Dagstuhl Seminar 22411). Dagstuhl Reports 12(10): 84-105 (2022) - 2021
- [j14]Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere:
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Comput. Complex. 30(1): 4 (2021) - [j13]Jo Devriendt, Ambros M. Gleixner, Jakob Nordström:
Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search. Constraints An Int. J. 26(1): 26-55 (2021) - [j12]Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov:
Clique Is Hard on Average for Regular Resolution. J. ACM 68(4): 23:1-23:26 (2021) - [c49]Jo Devriendt, Stephan Gocht, Emir Demirovic, Jakob Nordström, Peter J. Stuckey:
Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning. AAAI 2021: 3750-3758 - [c48]Stephan Gocht, Jakob Nordström:
Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs. AAAI 2021: 3768-3777 - [c47]Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Dmitry Sokolov:
The Power of Negative Reasoning. CCC 2021: 40:1-40:24 - [c46]Stephan Gocht, Jakob Nordström, Ruben Martins:
Certifying CNF Encodings of Pseudo-Boolean Constraints (abstract). PxTP 2021: 48 - [c45]Susanna F. de Rezende, Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov:
Automating algebraic proof systems is NP-hard. STOC 2021: 209-222 - [p1]Sam Buss, Jakob Nordström:
Proof Complexity and SAT Solving. Handbook of Satisfiability 2021: 233-350 - [i43]Buser Say, Scott Sanner, Jo Devriendt, Jakob Nordström, Peter J. Stuckey:
Planning with Learned Binarized Neural Networks Benchmarks for MaxSAT Evaluation 2021. CoRR abs/2108.00633 (2021) - [i42]Susanna F. de Rezende, Jakob Nordström, Marc Vinyals:
How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity). Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j11]Christoph Berkholz, Jakob Nordström:
Supercritical Space-Width Trade-offs for Resolution. SIAM J. Comput. 49(1): 98-118 (2020) - [c44]Jan Elffers, Stephan Gocht, Ciaran McCreesh, Jakob Nordström:
Justifying All Differences Using Pseudo-Boolean Reasoning. AAAI 2020: 1486-1494 - [c43]Jan Elffers, Jakob Nordström:
A Cardinal Improvement to Pseudo-Boolean Solving. AAAI 2020: 1495-1503 - [c42]Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov:
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. CCC 2020: 28:1-28:24 - [c41]Stephan Gocht, Ross McBride, Ciaran McCreesh, Jakob Nordström, Patrick Prosser, James Trimble:
Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems. CP 2020: 338-357 - [c40]Janne I. Kokkala, Jakob Nordström:
Using Resolution Proofs to Analyse CDCL Solvers. CP 2020: 427-444 - [c39]Buser Say, Jo Devriendt, Jakob Nordström, Peter J. Stuckey:
Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models. CP 2020: 917-934 - [c38]Vincent Liew, Paul Beame, Jo Devriendt, Jan Elffers, Jakob Nordström:
Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning. FMCAD 2020: 194-204 - [c37]Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals:
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. FOCS 2020: 24-30 - [c36]Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere:
KRW Composition Theorems via Lifting. FOCS 2020: 43-49 - [c35]Stephan Gocht, Ciaran McCreesh, Jakob Nordström:
Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions. IJCAI 2020: 1134-1140 - [c34]Guillaume Lagarde, Jakob Nordström, Dmitry Sokolov, Joseph Swernofsky:
Trade-Offs Between Size and Degree in Polynomial Calculus. ITCS 2020: 72:1-72:16 - [c33]Marc Vinyals, Jan Elffers, Jan Johannsen, Jakob Nordström:
Simplified and Improved Separations Between Regular and General Resolution by Lifting. SAT 2020: 182-200 - [d1]Jo Devriendt, Stephan Gocht, Emir Demirovic, Jakob Nordström, Peter J. Stuckey:
Experimental Repository for "Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning". Zenodo, 2020
- [i41]Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals:
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. CoRR abs/2001.02144 (2020) - [i40]Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere:
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. CoRR abs/2001.02481 (2020) - [i39]Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere:
KRW Composition Theorems via Lifting. CoRR abs/2007.02740 (2020) - [i38]Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov:
Clique Is Hard on Average for Regular Resolution. CoRR abs/2012.09476 (2020) - [i37]Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov, Susanna F. de Rezende:
Automating Algebraic Proof Systems is NP-Hard. Electron. Colloquium Comput. Complex. TR20 (2020) - [i36]Or Meir, Jakob Nordström, Robert Robere, Susanna F. de Rezende:
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Electron. Colloquium Comput. Complex. TR20 (2020) - [i35]Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere:
KRW Composition Theorems via Lifting. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c32]Susanna F. de Rezende, Jakob Nordström, Or Meir, Robert Robere:
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. CCC 2019: 18:1-18:16 - [c31]Stephan Gocht, Jakob Nordström, Amir Yehudayoff:
On Division Versus Saturation in Pseudo-Boolean Solving. IJCAI 2019: 1711-1718 - [i34]Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov:
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. CoRR abs/1912.00534 (2019) - [i33]Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Susanna F. de Rezende:
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. Electron. Colloquium Comput. Complex. TR19 (2019) - [i32]Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov:
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c30]Jan Elffers, Jakob Nordström:
Divide and Conquer: Towards Faster Pseudo-Boolean Solving. IJCAI 2018: 1291-1299 - [c29]Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström, Laurent Simon:
Seeking Practical CDCL Insights from Theoretical SAT Benchmarks. IJCAI 2018: 1300-1308 - [c28]Jan Elffers, Jesús Giráldez-Cru, Jakob Nordström, Marc Vinyals:
Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers. SAT 2018: 75-93 - [c27]Marc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström:
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving. SAT 2018: 292-310 - [c26]Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov:
Clique is hard on average for regular resolution. STOC 2018: 866-877 - [i31]Albert Atserias, Jakob Nordström, Pavel Pudlák, Rahul Santhanam:
Proof Complexity (Dagstuhl Seminar 18051). Dagstuhl Reports 8(1): 124-157 (2018) - 2017
- [j10]Massimo Lauria, Jakob Nordström:
Tight Size-Degree Bounds for Sums-of-Squares Proofs. Comput. Complex. 26(4): 911-948 (2017) - [c25]Massimo Lauria, Jakob Nordström:
Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases. CCC 2017: 2:1-2:20 - [c24]Joël Alwen, Susanna F. de Rezende, Jakob Nordström, Marc Vinyals:
Cumulative Space in Black-White Pebbling and Resolution. ITCS 2017: 38:1-38:21 - [c23]Massimo Lauria, Jan Elffers, Jakob Nordström, Marc Vinyals:
CNFgen: A Generator of Crafted Benchmarks. SAT 2017: 464-473 - 2016
- [j9]Albert Atserias, Massimo Lauria, Jakob Nordström:
Narrow Proofs May Be Maximally Long. ACM Trans. Comput. Log. 17(3): 19 (2016) - [c22]Susanna F. de Rezende, Jakob Nordström, Marc Vinyals:
How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity). FOCS 2016: 295-304 - [c21]Christoph Berkholz, Jakob Nordström:
Supercritical Space-Width Trade-Offs for Resolution. ICALP 2016: 57:1-57:14 - [c20]Christoph Berkholz, Jakob Nordström:
Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. LICS 2016: 267-276 - [c19]Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals:
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers. SAT 2016: 160-176 - [i30]Christoph Berkholz, Jakob Nordström:
Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. CoRR abs/1608.08704 (2016) - [i29]Christoph Berkholz, Jakob Nordström:
Supercritical Space-Width Trade-offs for Resolution. CoRR abs/1612.07162 (2016) - [i28]Christoph Berkholz, Jakob Nordström:
Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. Electron. Colloquium Comput. Complex. TR16 (2016) - [i27]Christoph Berkholz, Jakob Nordström:
Supercritical Space-Width Trade-offs for Resolution. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j8]Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen:
Space Complexity in Polynomial Calculus. SIAM J. Comput. 44(4): 1119-1153 (2015) - [j7]Jakob Nordström:
On the interplay between proof complexity and SAT solving. ACM SIGLOG News 2(3): 19-44 (2015) - [j6]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
From Small Space to Small Width in Resolution. ACM Trans. Comput. Log. 16(4): 28:1-28:15 (2015) - [c18]Massimo Lauria, Jakob Nordström:
Tight Size-Degree Bounds for Sums-of-Squares Proofs. CCC 2015: 448-466 - [c17]Mladen Miksa, Jakob Nordström:
A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds. CCC 2015: 467-487 - [c16]Siu Man Chan, Massimo Lauria, Jakob Nordström, Marc Vinyals:
Hardness of Approximation in PSPACE and Separation Results for Pebble Games. FOCS 2015: 466-485 - [i26]Massimo Lauria, Jakob Nordström:
Tight Size-Degree Bounds for Sums-of-Squares Proofs. CoRR abs/1504.01656 (2015) - [i25]Mladen Miksa, Jakob Nordström:
A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds. CoRR abs/1505.01358 (2015) - [i24]Armin Biere, Vijay Ganesh, Martin Grohe, Jakob Nordström, Ryan Williams:
Theory and Practice of SAT Solving (Dagstuhl Seminar 15171). Dagstuhl Reports 5(4): 98-122 (2015) - [i23]Massimo Lauria, Jakob Nordström:
Tight Size-Degree Bounds for Sums-of-Squares Proofs. Electron. Colloquium Comput. Complex. TR15 (2015) - [i22]Mladen Miksa, Jakob Nordström:
A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c15]Albert Atserias, Massimo Lauria, Jakob Nordström:
Narrow Proofs May Be Maximally Long. CCC 2014: 286-297 - [c14]Jakob Nordström:
A (Biased) Proof Complexity Survey for SAT Practitioners. SAT 2014: 1-6 - [c13]Mladen Miksa, Jakob Nordström:
Long Proofs of (Seemingly) Simple Formulas. SAT 2014: 121-137 - [c12]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
From Small Space to Small Width in Resolution. STACS 2014: 300-311 - [i21]Albert Atserias, Massimo Lauria, Jakob Nordström:
Narrow Proofs May Be Maximally Long. CoRR abs/1409.2731 (2014) - [i20]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
From Small Space to Small Width in Resolution. CoRR abs/1409.2978 (2014) - [i19]Albert Atserias, Massimo Lauria, Jakob Nordström:
Narrow Proofs May Be Maximally Long. Electron. Colloquium Comput. Complex. TR14 (2014) - [i18]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
From Small Space to Small Width in Resolution. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j5]Jakob Nordström:
Pebble Games, Proof Complexity, and Time-Space Trade-offs. Log. Methods Comput. Sci. 9(3) (2013) - [j4]Jakob Nordström, Johan Håstad:
Towards an Optimal Separation of Space and Length in Resolution. Theory Comput. 9: 471-557 (2013) - [c11]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract). ICALP (1) 2013: 437-448 - [c10]Chris Beck, Jakob Nordström, Bangsheng Tang:
Some trade-off results for polynomial calculus: extended abstract. STOC 2013: 813-822 - 2012
- [j3]Jakob Nordström:
On the Relative Strength of Pebbling and Resolution. ACM Trans. Comput. Log. 13(2): 16:1-16:43 (2012) - [c9]Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, Noga Ron-Zewi:
Space Complexity in Polynomial Calculus. CCC 2012: 334-344 - [c8]Matti Järvisalo, Arie Matsliah, Jakob Nordström, Stanislav Zivný:
Relating Proof Complexity Measures and Practical Hardness of SAT. CP 2012: 316-331 - [c7]Trinh Huynh, Jakob Nordström:
On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity. STOC 2012: 233-248 - [i17]Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen:
Space Complexity in Polynomial Calculus. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c6]Jakob Nordström, Alexander A. Razborov:
On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution. ICALP (1) 2011: 642-653 - [c5]Eli Ben-Sasson, Jakob Nordström:
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions. ICS 2011: 401-416 - 2010
- [c4]Jakob Nordström:
On the Relative Strength of Pebbling and Resolution. CCC 2010: 151-162 - [i16]Jakob Nordström:
On the Relative Strength of Pebbling and Resolution. CoRR abs/1003.3047 (2010) - [i15]Eli Ben-Sasson, Jakob Nordström:
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions. CoRR abs/1008.1789 (2010) - [i14]Arnab Bhattacharyya, Elena Grigorescu, Jakob Nordström, Ning Xie:
Separations of Matroid Freeness Properties. CoRR abs/1008.4401 (2010) - [i13]Eli Ben-Sasson, Jakob Nordström:
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions. Electron. Colloquium Comput. Complex. TR10 (2010) - [i12]Arnab Bhattacharyya, Elena Grigorescu, Jakob Nordström, Ning Xie:
Separations of Matroid Freeness Properties. Electron. Colloquium Comput. Complex. TR10 (2010) - [i11]Jakob Nordström:
On the Relative Strength of Pebbling and Resolution. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j2]Jakob Nordström:
A simplified way of proving trade-off results for resolution. Inf. Process. Lett. 109(18): 1030-1035 (2009) - [j1]Jakob Nordström:
Narrow Proofs May Be Spacious: Separating Space and Width in Resolution. SIAM J. Comput. 39(1): 59-121 (2009) - [i10]Jakob Nordström, Alexander A. Razborov:
On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution. CoRR abs/0910.3127 (2009) - [i9]Eli Ben-Sasson, Jakob Nordström:
Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution. Electron. Colloquium Comput. Complex. TR09 (2009) - [i8]Eli Ben-Sasson, Jakob Nordström:
Understanding Space in Resolution: Optimal Lower Bounds and Exponential Trade-offs. Electron. Colloquium Comput. Complex. TR09 (2009) - [i7]Eli Ben-Sasson, Jakob Nordström:
A Space Hierarchy for k-DNF Resolution. Electron. Colloquium Comput. Complex. TR09 (2009) - [i6]Jakob Nordström, Alexander A. Razborov:
On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [b1]Jakob Nordström:
Short Proofs May Be Spacious : Understanding Space in Resolution. Royal Institute of Technology, Stockholm, Sweden, 2008 - [c3]Eli Ben-Sasson, Jakob Nordström:
Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution. FOCS 2008: 709-718 - [c2]Jakob Nordström, Johan Håstad:
Towards an optimal separation of space and length in resolution. STOC 2008: 701-710 - [i5]Eli Ben-Sasson, Jakob Nordström:
Understanding space in resolution: optimal lower bounds and exponential trade-offs. Computational Complexity of Discrete Problems 2008 - [i4]Jakob Nordström, Johan Håstad:
Towards an Optimal Separation of Space and Length in Resolution. CoRR abs/0803.0661 (2008) - [i3]Jakob Nordström, Johan Håstad:
Towards an Optimal Separation of Space and Length in Resolution. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [i2]Jakob Nordström:
A Simplified Way of Proving Trade-off Results for Resolution. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c1]Jakob Nordström:
Narrow proofs may be spacious: separating space and width in resolution. STOC 2006: 507-516 - 2005
- [i1]Jakob Nordström:
Narrow Proofs May Be Spacious: Separating Space and Width in Resolution. Electron. Colloquium Comput. Complex. TR05 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
