Jakob Nordström
Professor
- 2012
On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity (Extended Abstract)
Huynh, T. & Nordström, Jakob, 1 maj 2012, Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC '12). Association for Computing Machinery, Inc., s. 233-248 16 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
On the relative strength of pebbling and resolution
Nordström, Jakob, apr. 2012, I: ACM Transactions on Computational Logic. 13, 2, a16.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Relating proof complexity measures and practical hardness of SAT
Järvisalo, M., Matsliah, A., Nordström, Jakob & Živný, S., 2012, Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Proceedings. s. 316-331 16 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 7514 LNCS).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Space complexity in polynomial calculus
Filmus, Y., Lauria, M., Nordström, Jakob, Thapen, N. & Ron-Zewi, N., 2012, Proceedings - 2012 IEEE 27th Conference on Computational Complexity, CCC 2012. s. 334-344 11 s. 6243410. (Proceedings of the Annual IEEE Conference on Computational Complexity).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 2011
- Udgivet
On minimal unsatisfiability and time-space trade-offs for k-DNF resolution
Nordström, Jakob & Razborov, A., 2011, Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings. PART 1 udg. s. 642-653 12 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Nr. PART 1, Bind 6755 LNCS).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 2010
- Udgivet
Separations of Matroid Freeness Properties
Bhattacharyya, A., Grigorescu, E., Nordström, Jakob & Xie, N., 1 aug. 2010.Publikation: Working paper › Forskning
- Udgivet
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions
Ben-Sasson, E. & Nordström, Jakob, 1 aug. 2010.Publikation: Working paper › Forskning
- Udgivet
On the relative strength of pebbling and resolution
Nordström, Jakob, 2010, Proceedings - 25th Annual IEEE Conference on Computational Complexity, CCC 2010. s. 151-162 12 s. 5497889. (Proceedings of the Annual IEEE Conference on Computational Complexity).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 2009
- Udgivet
A simplified way of proving trade-off results for resolution
Nordström, Jakob, 31 aug. 2009, I: Information Processing Letters. 109, 18, s. 1030-1035 6 s.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
- Udgivet
A Space Hierarchy for $k$-DNF Resolution
Ben-Sasson, E. & Nordström, Jakob, 1 apr. 2009.Publikation: Working paper › Forskning
ID: 209376262
Flest downloads
-
69
downloads
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Udgivet -
33
downloads
Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Udgivet -
25
downloads
Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Udgivet