Jakob Nordström

Jakob Nordström

Professor

Medlem af:

    ORCID: 0000-0002-2700-4285

    Udgivelsesår:
    Alle
    1 - 66 ud af 66Pr. side: 100
    Sortering: Udgivelsesdato
    1. 2023
    2. Udgivet

      Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps

      Berkholz, C. & Nordström, Jakob, 2023, I: Journal of the ACM. 70, 5, s. 1-32 32.

      Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

    3. 2022
    4. Udgivet

      Adding Dual Variables to Algebraic Reasoning for Gate-Level Multiplier Verification

      Kaufmann, D., Beame, P., Biere, A. & Nordström, Jakob, 2022, Proceedings of the 2022 Design, Automation and Test in Europe Conference and Exhibition, DATE 2022. Bolchini, C., Verbauwhede, I. & Vatajelu, I. (red.). IEEE, s. 1431-1436 6 s.

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    5. Udgivet

      An Auditable Constraint Programming Solver

      Gocht, S., McCreesh, C. & Nordström, Jakob, 2022, 28th International Conference on Principles and Practice of Constraint Programming, CP 2022. Solnon, C. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 25. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 235).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    6. Udgivet

      Certified CNF Translations for Pseudo-Boolean Solving

      Gocht, S., Martins, R., Nordström, Jakob & Oertel, A., 2022, 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022. Meel, K. S. & Strichman, O. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 16. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 236).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    7. 2021
    8. Udgivet

      Automating algebraic proof systems is NP-hard

      De Rezende, S. F., Göös, M., Nordström, Jakob, Pitassi, T., Robere, R. & Sokolov, D., 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (red.). Association for Computing Machinery, Inc., s. 209-222

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    9. Udgivet

      Learn to Relax: Integrating 0-1 Integer Linear Programming with Pseudo-Boolean Conflict-Driven Search

      Devriendt, J., Gleixner, A. & Nordström, Jakob, 2021, I: Constraints. 26, s. 26–55 30 s.

      Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

    10. Udgivet

      Proof Complexity and SAT Solving

      Buss, S. & Nordström, Jakob, 2021, Handbook of Satisfiability. Biere, A., Heule, M. J. H., van Maaren, H. & Walsh, T. (red.). 2 udg. IMIA and IOS Press, s. 233 - 350 (Frontiers in Artificial Intelligence and Applications, Bind 336).

      Publikation: Bidrag til bog/antologi/rapport › Bidrag til bog/antologi › Forskning › fagfællebedømt

    11. Udgivet

      The Power of Negative Reasoning

      de Rezende, S. F., Lauria, M., Nordström, Jakob & Sokolov, D., 2021, 36th Computational Complexity Conference, CCC 2021. Kabanets, V. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 24 s. 40. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 200).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    12. 2020
    13. Udgivet

      KRW Composition Theorems via Lifting

      de Rezende, S., Meir, O., Nordström, Jakob, Pitassi, T. & Robere, R., 1 nov. 2020, Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS '20). IEEE, s. 4149

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    14. Udgivet

      Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity

      de Rezende, S. F., Meir, O., Nordström, Jakob, Pitassi, T., Robere, R. & Vinyals, M., 1 nov. 2020, Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS '20). IEEE, s. 24-30

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    15. Udgivet

      Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning

      Liew, V., Beame, P., Devriendt, J., Elffers, J. & Nordström, Jakob, 1 sep. 2020, Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design (FMCAD '20). IEEE, s. 194-204 9283622,

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    16. Udgivet

      Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs

      de Rezende, S. F., Nordström, Jakob, Risse, K. & Sokolov, D., 1 jul. 2020, 35th Computational Complexity Conference, CCC 2020. Saraf, S. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, s. 1-24 28. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 169).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    17. Udgivet

      Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions

      Gocht, S., McCreesh, C. & Nordström, Jakob, 1 jul. 2020, Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI '20). International Joint Conferences on Artificial Intelligence, s. 1134-1140 7 s.

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    18. Udgivet

      Automating Algebraic Proof Systems is NP-Hard

      de Rezende, S. F., Göös, M., Nordström, Jakob, Pitassi, T., Robere, R. & Sokolov, D., 1 maj 2020, Electronic Colloquium on Computational Complexity, 34 s.

      Publikation: Working paper › Forskning

    19. Udgivet

      A Cardinal Improvement to Pseudo-Boolean Solving

      Elffers, J. & Nordström, Jakob, 1 feb. 2020, Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI '20). AAAI Press, s. 1495-1503 9 s.

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    20. Udgivet

      Justifying All Differences Using Pseudo-Boolean Reasoning

      Elffers, J., Gocht, S., McCreesh, C. & Nordström, Jakob, 1 feb. 2020, Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI '20). AAAI Press, s. 1486-1494 9 s.

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    21. Udgivet

      Trade-offs between size and degree in polynomial calculus

      Lagarde, G., Nordström, Jakob, Sokolov, D. & Swernofsky, J., jan. 2020, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020. Vidick, T. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, s. 1-16 72. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 151).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    22. Udgivet

      Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems

      Gocht, S., McBride, R., McCreesh, C., Nordström, Jakob, Prosser, P. & Trimble, J., 2020, Principles and Practice of Constraint Programming: 26th International Conference, CP 2020, Proceedings. Simonis, H. (red.). Springer, s. 338-357 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 12333 LNCS).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    23. Udgivet

      Simplified and Improved Separations Between Regular and General Resolution by Lifting

      Vinyals, M., Elffers, J., Johannsen, J. & Nordström, Jakob, 2020, Theory and Applications of Satisfiability Testing – SAT 2020 - 23rd International Conference, Proceedings. Pulina, L. & Seidl, M. (red.). Springer, s. 182-200 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 12178 LNCS).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    24. Udgivet

      Supercritical space-width trade-offs for resolution

      Berkholz, C. & Nordström, Jakob, 2020, I: SIAM Journal on Computing. 49, 1, s. 98-118

      Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

    25. Udgivet

      Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models

      Say, B., Devriendt, J., Nordström, Jakob & Stuckey, P. J., 2020, Principles and Practice of Constraint Programming: 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7–11, 2020, Proceedings. Simonis, H. (red.). Springer, s. 917-934 18 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 12333 LNCS).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    26. Udgivet

      Using Resolution Proofs to Analyse CDCL Solvers

      Kokkala, J. I. & Nordström, Jakob, 2020, Principles and Practice of Constraint Programming : 26th International Conference, CP 2020, Proceedings. Simonis, H. (red.). Springer, s. 427-444 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 12333 LNCS).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    27. 2019
    28. Udgivet

      Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

      de Rezende, S. F., Nordström, Jakob, Meir, O. & Robere, R., 2019, 34th Computational Complexity Conference (CCC 2019), Proceedings. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Bind 137. s. 1-16 18. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 137).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    29. Udgivet

      On division versus saturation in pseudo-boolean solving

      Gocht, S., Nordström, Jakob & Yehudayoff, A., 2019, Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019. Kraus, S. (red.). International Joint Conferences on Artificial Intelligence, s. 1711-1718

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    30. 2018

    31. Clique is hard on average for regular resolution

      Atserias, A., Lauria, M., Bonacina, I., Nordström, Jakob, De Rezende, S. F. & Razborov, A., 20 jun. 2018, STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Henzinger, M., Kempe, D. & Diakonikolas, I. (red.). ACM Association for Computing Machinery, s. 646-659 14 s. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    32. Divide and conquer: Towards faster pseudo-boolean solving

      Elffers, J. & Nordström, Jakob, 2018, Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. Lang, J. (red.). International Joint Conferences on Artificial Intelligence, s. 1291-1299 9 s. (IJCAI International Joint Conference on Artificial Intelligence, Bind 2018-July).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    33. In between resolution and cutting planes: A study of proof systems for pseudo-boolean SAT solving

      Vinyals, M., Elffers, J., Giráldez-Cru, J., Gocht, S. & Nordström, Jakob, 2018, Theory and Applications of Satisfiability Testing – SAT 2018 - 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings. Beyersdorff, O. & Wintersteiger, C. M. (red.). Springer Verlag, s. 292-310 19 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 10929 LNCS).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    34. Seeking practical CDCL insights from theoretical SAT benchmarks

      Elffers, J., Cru, J. G., Gocht, S., Nordström, Jakob & Simon, L., 2018, Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. Lang, J. (red.). International Joint Conferences on Artificial Intelligence, s. 1300-1308 9 s. (IJCAI International Joint Conference on Artificial Intelligence, Bind 2018-July).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    35. Using combinatorial benchmarks to probe the reasoning power of pseudo-boolean solvers

      Elffers, J., Giráldez-Cru, J., Nordström, Jakob & Vinyals, M., 2018, Theory and Applications of Satisfiability Testing – SAT 2018 - 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings. Beyersdorff, O. & Wintersteiger, C. M. (red.). Springer Verlag, s. 75-93 19 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 10929 LNCS).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    36. 2017

    37. Tight Size-Degree Bounds for Sums-of-Squares Proofs

      Lauria, M. & Nordström, Jakob, 1 dec. 2017, I: Computational Complexity. 26, 4, s. 911-948 38 s.

      Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

    38. Cumulative space in black-white pebbling and resolution

      Alwen, J., De Rezende, S. F., Nordström, Jakob & Vinyals, M., 1 nov. 2017, 8th Innovations in Theoretical Computer Science Conference, ITCS 2017. Papadimitriou, C. H. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs, Bind 67).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    39. Graph colouring is hard for algorithms based on hilbert's nullstellensatz and gröbner bases

      Lauria, M. & Nordström, Jakob, 1 jul. 2017, 32nd Computational Complexity Conference, CCC 2017. O'Donnell, R. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 79).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    40. CNFgen: A generator of crafted benchmarks

      Lauria, M., Elffers, J., Nordström, Jakob & Vinyals, M., 2017, Theory and Applications of Satisfiability Testing – SAT 2017 - 20th International Conference, Proceedings. Gaspers, S. & Walsh, T. (red.). Springer Verlag, s. 464-473 10 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 10491 LNCS).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    41. 2016

    42. 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

    43. Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler - Leman Refinement Steps

      Berkholz, C. & Nordström, Jakob, 5 jul. 2016, Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science, LICS 2016. Institute of Electrical and Electronics Engineers Inc., s. 267-276 10 s. (Proceedings - Symposium on Logic in Computer Science, Bind 05-08-July-2016).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    44. Narrow proofs may be maximally long

      Atserias, A., Lauria, M. & Nordström, Jakob, feb. 2016, I: ACM Transactions on Computational Logic. 17, 3, 19.

      Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

    45. 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

    46. 2015

    47. 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

    48. 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

    49. 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

    50. 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

    51. 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

    52. 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

    53. 2014

    54. 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

    55. A (biased) proof complexity survey for SAT practitioners

      Nordström, Jakob, 2014, Theory and Applications of Satisfiability Testing, SAT 2014 - 17th International Conference, Held as Part of theVienna Summer of Logic, VSL 2014, Proceedings. Springer Verlag, s. 1-6 6 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 8561 LNCS).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    56. Long Proofs of (Seemingly) Simple Formulas

      Mikša, M. & Nordström, Jakob, 2014, Theory and Applications of Satisfiability Testing, SAT 2014 - 17th International Conference, Held as Part of theVienna Summer of Logic, VSL 2014, Proceedings. Springer Verlag, s. 121-137 17 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 8561 LNCS).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    57. 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

    58. 2013

    59. Pebble games, proof complexity, and time-space trade-offs

      Nordström, Jakob, 13 sep. 2013, I: Logical Methods in Computer Science. 9, 3, 15.

      Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

    60. Some trade-off results for polynomial calculus

      Beck, C., Nordström, Jakob & Tang, B., 2013, STOC 2013 - Proceedings of the 2013 ACM Symposium on Theory of Computing. s. 813-822 10 s. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    61. Towards an understanding of polynomial calculus: New separations and lower bounds (extended abstract)

      Filmus, Y., Lauria, M., Mikša, M., Nordström, Jakob & Vinyals, M., 2013, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings. PART 1 udg. s. 437-448 12 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Nr. PART 1, Bind 7965 LNCS).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    62. 2012

    63. 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

    64. 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

    65. 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

    66. 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

    67. 2011
    68. 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

    69. 2010
    70. Udgivet

      Separations of Matroid Freeness Properties

      Bhattacharyya, A., Grigorescu, E., Nordström, Jakob & Xie, N., 1 aug. 2010.

      Publikation: Working paper › Forskning

    71. 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

    72. 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

    73. 2009
    74. 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

    75. Udgivet

      A Space Hierarchy for $k$-DNF Resolution

      Ben-Sasson, E. & Nordström, Jakob, 1 apr. 2009.

      Publikation: Working paper › Forskning

    76. Udgivet

      Narrow proofs may be spacious: Separating space and width in resolution

      Nordström, Jakob, 2009, I: SIAM Journal on Computing. 39, 1, s. 59-121 63 s.

      Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

    77. 2008
    78. Udgivet

      Short Proofs May Be Spacious: Understanding Space in Resolution

      Nordström, Jakob, 1 maj 2008

      Publikation: Bog/antologi/afhandling/rapport › Rapport › Forskning › fagfællebedømt

    79. Udgivet

      Short proofs may be spacious: An optimal separation of space and length in resolution

      Ben-Sasson, E. & Nordström, Jakob, 2008, Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008. s. 709-718 10 s. 4691003. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    80. Udgivet

      Towards an optimal separation of space and length in resolution

      Nordström, Jakob & Håstad, J., 2008, STOC'08: Proceedings of the 2008 ACM Symposium on Theory of Computing. Association for Computing Machinery (ACM), s. 701-710 10 s. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    81. 2006
    82. Udgivet

      Narrow proofs may be spacious: Separating space and width in resolution

      Nordström, Jakob, 2006, STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. s. 507-516 10 s. (Proceedings of the Annual ACM Symposium on Theory of Computing, Bind 2006).

      Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

    83. 2001
    84. Udgivet

      Stålmarck's Method Versus Resolution: a Comparative Theoretical Study

      Nordström, Jakob, 2001

      Publikation: Bog/antologi/afhandling/rapport › Rapport › Forskning

    ID: 209376262