Jakob Nordström

146 papers A* 27A 33B 1Journal 76Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Faster Certified Symmetry Breaking Using Orders with Auxiliary Variables. AAAI Markus Anders, Bart Bogaerts, Benjamin Bogø, Arthur Gontier, Wietze Koops, Ciaran McCreesh, Magnus O. Myreen, Jakob Nordström, Andy Oertel, Adrian Rebola-Pardo, Yong Kiam Tan
2025	A	`ed.`	28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025, Glasgow, Scotland, August 12-15, 2025 SAT Jeremias Berg, Jakob Nordström
2025	J	`jnl`	Certifying Algorithms for Automated Reasoning (Dagstuhl Seminar 25231). Dagstuhl Reports Nikolaj S. Bjørner, Marijn J. H. Heule, Daniela Kaufmann, Jakob Nordström, Wietze Koops
2025	J	`jnl`	Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. TheoretiCS Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov
2025	J	`jnl`	Faster Certified Symmetry Breaking Using Orders With Auxiliary Variables. CoRR Markus Anders, Bart Bogaerts, Benjamin Bogø, Arthur Gontier, Wietze Koops, Ciaran McCreesh, Magnus O. Myreen, Jakob Nordström, Andy Oertel, Adrian Rebola-Pardo, Yong Kiam Tan
2025	J	`jnl`	Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz. CoRR Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse
2025	J	`jnl`	Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz. Electron. Colloquium Comput. Complex. Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse
2025	A	`conf`	Practically Feasible Proof Logging for Pseudo-Boolean Optimization. CP Wietze Koops, Daniel Le Berre, Magnus O. Myreen, Jakob Nordström, Andy Oertel, Yong Kiam Tan, Marc Vinyals
2025	J	`jnl`	Pseudo-Boolean Proof Logging for Optimal Classical Planning. CoRR Simon Dold, Malte Helmert, Jakob Nordström, Gabriele Röger, Tanja Schindler
2025	J	`jnl`	Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds. Theory Comput. Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals
2025	A*	`conf`	Truly Supercritical Trade-Offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman. STOC Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang
2024	J	`jnl`	A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds. J. ACM Mladen Miksa, Jakob Nordström
2024	—	`conf`	Certified MaxSAT Preprocessing. IJCAR (1) Hannes Ihalainen, Andy Oertel, Yong Kiam Tan, Jeremias Berg, Matti Järvisalo, Magnus O. Myreen, Jakob Nordström
2024	J	`jnl`	Certified MaxSAT Preprocessing. CoRR Hannes Ihalainen, Andy Oertel, Yong Kiam Tan, Jeremias Berg, Matti Järvisalo, Jakob Nordström
2024	—	`conf`	Certifying MIP-Based Presolve Reductions for 0-1 Integer Linear Programs. CPAIOR (1) Alexander Hoen, Andy Oertel, Ambros M. Gleixner, Jakob Nordström
2024	A	`conf`	Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability. CP Jeremias Berg, Bart Bogaerts, Jakob Nordström, Andy Oertel, Tobias Paxian, Dieter Vandesande
2024	A*	`conf`	End-to-End Verification for Subgraph Solving. AAAI Stephan Gocht, Ciaran McCreesh, Magnus O. Myreen, Jakob Nordström, Andy Oertel, Yong Kiam Tan
2024	J	`jnl`	KRW Composition Theorems via Lifting. Comput. Complex. Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
2024	—	`conf`	Proof Logging for the Circuit Constraint. CPAIOR (2) Matthew J. McIlree, Ciaran McCreesh, Jakob Nordström
2024	A	`conf`	Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms. CP Emir Demirovic, Ciaran McCreesh, Matthew J. McIlree, Jakob Nordström, Andy Oertel, Konstantin Sidorov
2024	J	`jnl`	Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman. CoRR Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang
2024	J	`jnl`	Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman. Electron. Colloquium Comput. Complex. Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang
2023	A*	`conf`	Certified CNF Translations for Pseudo-Boolean Solving (Extended Abstract). IJCAI Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel
2023	A	`conf`	Certified Core-Guided MaxSAT Solving. CADE Jeremias Berg, Bart Bogaerts, Jakob Nordström, Andy Oertel, Dieter Vandesande
2023	J	`jnl`	Certified Dominance and Symmetry Breaking for Combinatorial Optimisation. J. Artif. Intell. Res. Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström
2023	A*	`conf`	Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz. FOCS Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse
2023	J	`jnl`	Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases. CoRR Massimo Lauria, Jakob Nordström
2023	J	`jnl`	Hardness of Approximation in PSPACE and Separation Results for Pebble Games. CoRR Siu Man Chan, Massimo Lauria, Jakob Nordström, Marc Vinyals
2023	A	`conf`	Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning. CP Gioni Mexi, Timo Berthold, Ambros M. Gleixner, Jakob Nordström
2023	J	`jnl`	Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning. CoRR Gioni Mexi, Timo Berthold, Ambros M. Gleixner, Jakob Nordström
2023	J	`jnl`	Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. J. ACM Christoph Berkholz, Jakob Nordström
2022	A	`conf`	Adding Dual Variables to Algebraic Reasoning for Gate-Level Multiplier Verification. DATE Daniela Kaufmann, Paul Beame, Armin Biere, Jakob Nordström
2022	A	`conf`	An Auditable Constraint Programming Solver. CP Stephan Gocht, Ciaran McCreesh, Jakob Nordström
2022	A	`conf`	Certified CNF Translations for Pseudo-Boolean Solving. SAT Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel
2022	A*	`conf`	Certified Symmetry and Dominance Breaking for Combinatorial Optimisation. AAAI Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström
2022	J	`jnl`	Certified Symmetry and Dominance Breaking for Combinatorial Optimisation. CoRR Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström
2022	J	`jnl`	Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs. CoRR Stephan Gocht, Jakob Nordström
2022	J	`jnl`	Theory and Practice of SAT and Combinatorial Solving (Dagstuhl Seminar 22411). Dagstuhl Reports Olaf Beyersdorff, Armin Biere, Vijay Ganesh, Jakob Nordström, Andy Oertel
2021	A*	`conf`	Automating algebraic proof systems is NP-hard. STOC Susanna F. de Rezende, Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov
2021	—	`conf`	Certifying CNF Encodings of Pseudo-Boolean Constraints (abstract). PxTP Stephan Gocht, Jakob Nordström, Ruben Martins
2021	A*	`conf`	Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs. AAAI Stephan Gocht, Jakob Nordström
2021	J	`jnl`	Clique Is Hard on Average for Regular Resolution. J. ACM Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov
2021	A*	`conf`	Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning. AAAI Jo Devriendt, Stephan Gocht, Emir Demirovic, Jakob Nordström, Peter J. Stuckey
2021	J	`jnl`	How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity). Electron. Colloquium Comput. Complex. Susanna F. de Rezende, Jakob Nordström, Marc Vinyals
2021	J	`jnl`	Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search. Constraints An Int. J. Jo Devriendt, Ambros M. Gleixner, Jakob Nordström
2021	J	`jnl`	Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Comput. Complex. Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere
2021	J	`jnl`	Planning with Learned Binarized Neural Networks Benchmarks for MaxSAT Evaluation 2021. CoRR Buser Say, Scott Sanner, Jo Devriendt, Jakob Nordström, Peter J. Stuckey
2021	—	`ch.`	Proof Complexity and SAT Solving. Handbook of Satisfiability Sam Buss, Jakob Nordström
2021	A	`conf`	The Power of Negative Reasoning. CCC Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Dmitry Sokolov
2020	A*	`conf`	A Cardinal Improvement to Pseudo-Boolean Solving. AAAI Jan Elffers, Jakob Nordström
2020	J	`jnl`	Automating Algebraic Proof Systems is NP-Hard. Electron. Colloquium Comput. Complex. Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov, Susanna F. de Rezende
2020	A	`conf`	Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems. CP Stephan Gocht, Ross McBride, Ciaran McCreesh, Jakob Nordström, Patrick Prosser, James Trimble
2020	J	`jnl`	Clique Is Hard on Average for Regular Resolution. CoRR Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov
2020	A	`conf`	Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. CCC Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov
2020	A*	`conf`	Justifying All Differences Using Pseudo-Boolean Reasoning. AAAI Jan Elffers, Stephan Gocht, Ciaran McCreesh, Jakob Nordström
2020	A*	`conf`	KRW Composition Theorems via Lifting. FOCS Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
2020	J	`jnl`	KRW Composition Theorems via Lifting. CoRR Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
2020	J	`jnl`	KRW Composition Theorems via Lifting. Electron. Colloquium Comput. Complex. Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
2020	A*	`conf`	Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. FOCS Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals
2020	J	`jnl`	Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. CoRR Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals
2020	J	`jnl`	Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. CoRR Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere
2020	J	`jnl`	Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Electron. Colloquium Comput. Complex. Or Meir, Jakob Nordström, Robert Robere, Susanna F. de Rezende
2020	A	`conf`	Simplified and Improved Separations Between Regular and General Resolution by Lifting. SAT Marc Vinyals, Jan Elffers, Jan Johannsen, Jakob Nordström
2020	A*	`conf`	Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions. IJCAI Stephan Gocht, Ciaran McCreesh, Jakob Nordström
2020	J	`jnl`	Supercritical Space-Width Trade-offs for Resolution. SIAM J. Comput. Christoph Berkholz, Jakob Nordström
2020	A	`conf`	Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models. CP Buser Say, Jo Devriendt, Jakob Nordström, Peter J. Stuckey
2020	A	`conf`	Trade-Offs Between Size and Degree in Polynomial Calculus. ITCS Guillaume Lagarde, Jakob Nordström, Dmitry Sokolov, Joseph Swernofsky
2020	A	`conf`	Using Resolution Proofs to Analyse CDCL Solvers. CP Janne I. Kokkala, Jakob Nordström
2020	B	`conf`	Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning. FMCAD Vincent Liew, Paul Beame, Jo Devriendt, Jan Elffers, Jakob Nordström
2019	J	`jnl`	Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. CoRR Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov
2019	J	`jnl`	Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. Electron. Colloquium Comput. Complex. Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov
2019	J	`jnl`	Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. Electron. Colloquium Comput. Complex. Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Susanna F. de Rezende
2019	A	`conf`	Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. CCC Susanna F. de Rezende, Jakob Nordström, Or Meir, Robert Robere
2019	A*	`conf`	On Division Versus Saturation in Pseudo-Boolean Solving. IJCAI Stephan Gocht, Jakob Nordström, Amir Yehudayoff
2018	A*	`conf`	Clique is hard on average for regular resolution. STOC Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov
2018	A*	`conf`	Divide and Conquer: Towards Faster Pseudo-Boolean Solving. IJCAI Jan Elffers, Jakob Nordström
2018	A	`conf`	In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving. SAT Marc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström
2018	J	`jnl`	Proof Complexity (Dagstuhl Seminar 18051). Dagstuhl Reports Albert Atserias, Jakob Nordström, Pavel Pudlák, Rahul Santhanam
2018	A*	`conf`	Seeking Practical CDCL Insights from Theoretical SAT Benchmarks. IJCAI Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström, Laurent Simon
2018	A	`conf`	Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers. SAT Jan Elffers, Jesús Giráldez-Cru, Jakob Nordström, Marc Vinyals
2017	A	`conf`	CNFgen: A Generator of Crafted Benchmarks. SAT Massimo Lauria, Jan Elffers, Jakob Nordström, Marc Vinyals
2017	A	`conf`	Cumulative Space in Black-White Pebbling and Resolution. ITCS Joël Alwen, Susanna F. de Rezende, Jakob Nordström, Marc Vinyals
2017	A	`conf`	Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases. CCC Massimo Lauria, Jakob Nordström
2017	J	`jnl`	Tight Size-Degree Bounds for Sums-of-Squares Proofs. Comput. Complex. Massimo Lauria, Jakob Nordström
2016	A*	`conf`	How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity). FOCS Susanna F. de Rezende, Jakob Nordström, Marc Vinyals
2016	J	`jnl`	Narrow Proofs May Be Maximally Long. ACM Trans. Comput. Log. Albert Atserias, Massimo Lauria, Jakob Nordström
2016	A*	`conf`	Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. LICS Christoph Berkholz, Jakob Nordström
2016	J	`jnl`	Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. CoRR Christoph Berkholz, Jakob Nordström
2016	J	`jnl`	Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. Electron. Colloquium Comput. Complex. Christoph Berkholz, Jakob Nordström
2016	A*	`conf`	Supercritical Space-Width Trade-Offs for Resolution. ICALP Christoph Berkholz, Jakob Nordström
2016	J	`jnl`	Supercritical Space-Width Trade-offs for Resolution. CoRR Christoph Berkholz, Jakob Nordström
2016	J	`jnl`	Supercritical Space-Width Trade-offs for Resolution. Electron. Colloquium Comput. Complex. Christoph Berkholz, Jakob Nordström
2016	A	`conf`	Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers. SAT Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals
2015	A	`conf`	A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds. CCC Mladen Miksa, Jakob Nordström
2015	J	`jnl`	A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds. CoRR Mladen Miksa, Jakob Nordström
2015	J	`jnl`	A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds. Electron. Colloquium Comput. Complex. Mladen Miksa, Jakob Nordström
2015	J	`jnl`	From Small Space to Small Width in Resolution. ACM Trans. Comput. Log. Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals
2015	A*	`conf`	Hardness of Approximation in PSPACE and Separation Results for Pebble Games. FOCS Siu Man Chan, Massimo Lauria, Jakob Nordström, Marc Vinyals
2015	J	`jnl`	On the interplay between proof complexity and SAT solving. ACM SIGLOG News Jakob Nordström
2015	J	`jnl`	Space Complexity in Polynomial Calculus. SIAM J. Comput. Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen
2015	J	`jnl`	Theory and Practice of SAT Solving (Dagstuhl Seminar 15171). Dagstuhl Reports Armin Biere, Vijay Ganesh, Martin Grohe, Jakob Nordström, Ryan Williams
2015	A	`conf`	Tight Size-Degree Bounds for Sums-of-Squares Proofs. CCC Massimo Lauria, Jakob Nordström
2015	J	`jnl`	Tight Size-Degree Bounds for Sums-of-Squares Proofs. CoRR Massimo Lauria, Jakob Nordström
2015	J	`jnl`	Tight Size-Degree Bounds for Sums-of-Squares Proofs. Electron. Colloquium Comput. Complex. Massimo Lauria, Jakob Nordström
2014	A	`conf`	A (Biased) Proof Complexity Survey for SAT Practitioners. SAT Jakob Nordström
2014	A	`conf`	From Small Space to Small Width in Resolution. STACS Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals
2014	J	`jnl`	From Small Space to Small Width in Resolution. CoRR Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals
2014	J	`jnl`	From Small Space to Small Width in Resolution. Electron. Colloquium Comput. Complex. Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals
2014	A	`conf`	Long Proofs of (Seemingly) Simple Formulas. SAT Mladen Miksa, Jakob Nordström
2014	A	`conf`	Narrow Proofs May Be Maximally Long. CCC Albert Atserias, Massimo Lauria, Jakob Nordström
2014	J	`jnl`	Narrow Proofs May Be Maximally Long. CoRR Albert Atserias, Massimo Lauria, Jakob Nordström
2014	J	`jnl`	Narrow Proofs May Be Maximally Long. Electron. Colloquium Comput. Complex. Albert Atserias, Massimo Lauria, Jakob Nordström
2013	J	`jnl`	Pebble Games, Proof Complexity, and Time-Space Trade-offs. Log. Methods Comput. Sci. Jakob Nordström
2013	A*	`conf`	Some trade-off results for polynomial calculus: extended abstract. STOC Chris Beck, Jakob Nordström, Bangsheng Tang
2013	J	`jnl`	Towards an Optimal Separation of Space and Length in Resolution. Theory Comput. Jakob Nordström, Johan Håstad
2013	—	`conf`	Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract). ICALP (1) Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals
2012	J	`jnl`	On the Relative Strength of Pebbling and Resolution. ACM Trans. Comput. Log. Jakob Nordström
2012	A*	`conf`	On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity. STOC Trinh Huynh, Jakob Nordström
2012	A	`conf`	Relating Proof Complexity Measures and Practical Hardness of SAT. CP Matti Järvisalo, Arie Matsliah, Jakob Nordström, Stanislav Zivný
2012	A	`conf`	Space Complexity in Polynomial Calculus. CCC Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, Noga Ron-Zewi
2012	J	`jnl`	Space Complexity in Polynomial Calculus. Electron. Colloquium Comput. Complex. Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen
2011	—	`conf`	On Minimal Unsatisfiability and Time-Space Trade-offs for ICALP (1) Jakob Nordström, Alexander A. Razborov
2011	A	`conf`	Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions. ICS Eli Ben-Sasson, Jakob Nordström
2010	J	`jnl`	On the Relative Strength of Pebbling and Resolution CoRR Jakob Nordström
2010	A	`conf`	On the Relative Strength of Pebbling and Resolution. CCC Jakob Nordström
2010	J	`jnl`	On the Relative Strength of Pebbling and Resolution. Electron. Colloquium Comput. Complex. Jakob Nordström
2010	J	`jnl`	Separations of Matroid Freeness Properties CoRR Arnab Bhattacharyya, Elena Grigorescu, Jakob Nordström, Ning Xie
2010	J	`jnl`	Separations of Matroid Freeness Properties. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Elena Grigorescu, Jakob Nordström, Ning Xie
2010	J	`jnl`	Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions CoRR Eli Ben-Sasson, Jakob Nordström
2010	J	`jnl`	Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Jakob Nordström
2009	J	`jnl`	A Space Hierarchy for k-DNF Resolution. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Jakob Nordström
2009	J	`jnl`	A simplified way of proving trade-off results for resolution. Inf. Process. Lett. Jakob Nordström
2009	J	`jnl`	Narrow Proofs May Be Spacious: Separating Space and Width in Resolution. SIAM J. Comput. Jakob Nordström
2009	J	`jnl`	On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution CoRR Jakob Nordström, Alexander A. Razborov
2009	J	`jnl`	On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution. Electron. Colloquium Comput. Complex. Jakob Nordström, Alexander A. Razborov
2009	J	`jnl`	Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Jakob Nordström
2009	J	`jnl`	Understanding Space in Resolution: Optimal Lower Bounds and Exponential Trade-offs. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Jakob Nordström
2008	—	`—`	Short Proofs May Be Spacious : Understanding Space in Resolution. Jakob Nordström
2008	A*	`conf`	Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution. FOCS Eli Ben-Sasson, Jakob Nordström
2008	J	`jnl`	Towards an Optimal Separation of Space and Length in Resolution CoRR Jakob Nordström, Johan Håstad
2008	J	`jnl`	Towards an Optimal Separation of Space and Length in Resolution. Electron. Colloquium Comput. Complex. Jakob Nordström, Johan Håstad
2008	A*	`conf`	Towards an optimal separation of space and length in resolution. STOC Jakob Nordström, Johan Håstad
2008	—	`conf`	Understanding space in resolution: optimal lower bounds and exponential trade-offs. Computational Complexity of Discrete Problems Eli Ben-Sasson, Jakob Nordström
2007	J	`jnl`	A Simplified Way of Proving Trade-off Results for Resolution. Electron. Colloquium Comput. Complex. Jakob Nordström
2006	A*	`conf`	Narrow proofs may be spacious: separating space and width in resolution. STOC Jakob Nordström
2005	J	`jnl`	Narrow Proofs May Be Spacious: Separating Space and Width in Resolution Electron. Colloquium Comput. Complex. Jakob Nordström