Jakob Nordström
Professor
- 2016
Supercritical space-width trade-offs for resolution
Berkholz, C. & Nordström, Jakob, 1 aug. 2016, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. Rabani, Y., Chatzigiannakis, I., Sangiorgi, D. & Mitzenmacher, M. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 57. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 55).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Trade-offs between time and memory in a tighter model of CDCL SAT solvers
Elffers, J., Johannsen, J., Lauria, M., Magnard, T., Nordström, Jakob & Vinyals, M., 2016, Theory and Applications of Satisfiability Testing – SAT 2016 - 19th International Conference, Proceedings. Le Berre, D. & Creignou, N. (red.). Springer Verlag, s. 160-176 17 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 9710).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 2015
Hardness of Approximation in PSPACE and Separation Results for Pebble Games (Extended Abstract)
Chan, S. M., Lauria, M., Nordström, Jakob & Vinyals, M., 1 okt. 2015, Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS~'15). IEEE, s. 466-485 20 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
From small space to small width in resolution
Filmus, Y., Lauria, M., Mikša, M., Nordström, Jakob & Vinyals, M., 1 aug. 2015, I: ACM Transactions on Computational Logic. 16, 4, 28.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Space complexity in polynomial calculus
Filmus, Y., Lauria, M., Nordström, Jakob, Ron-Zewi, N. & Thapen, N., 2015, I: SIAM Journal on Computing. 44, 4, s. 1119-1153 35 s.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Tight size-degree bounds for sums-of-squares proofs
Lauria, M. & Nordström, Jakob, 1 jun. 2015, 30th Conference on Computational Complexity, CCC 2015. Zuckerman, D. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, s. 448-466 19 s. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 33).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
A generalized method for proving polynomial calculus degree lower bounds
Mikša, M. & Nordström, Jakob, 1 jun. 2015, 30th Conference on Computational Complexity, CCC 2015. Zuckerman, D. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, s. 467-487 21 s. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 33).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
On the Interplay Between Proof Complexity and SAT Solving
Nordström, Jakob, 1 jul. 2015, I: ACM SIGLOG News. 2, 3, s. 19-44 26 s.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
- 2014
Narrow proofs may be maximally long
Atserias, A., Lauria, M. & Nordström, Jakob, 2014, Proceedings - IEEE 29th Conference on Computational Complexity, CCC 2014. IEEE Computer Society Press, s. 286-297 12 s. 6875497. (Proceedings of the Annual IEEE Conference on Computational Complexity).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
From small space to small width in resolution
Filmus, Y., Lauria, M., Mikša, M., Nordström, Jakob & Vinyals, M., 1 mar. 2014, 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014. Portier, N. & Mayr, E. W. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Bind 25. s. 300-311 12 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
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