Jakob Nordström

Jakob Nordström

Professor

Medlem af:

    ORCID: 0000-0002-2700-4285

    Udgivelsesår:
    Alle
    21 - 30 ud af 71Pr. side: 10
    Sortering: Udgivelsesår
    1. 2014

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

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

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

    5. 2015

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

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

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

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

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

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

    12. 2016

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

    Forrige 1 2 3 4 5 6 7 8 Næste

    ID: 209376262