Jakob Nordström

41 – 50 of 73

show: 10
|
sort: year (new to old)

News feed Embed this list Save this search Mark all Export

Cancel

Embed this list

copy and paste the html snippet below into your own page:

<iframe src="https://lup.lub.lu.se/search/person/984829bd-2059-42df-abef-4bba2bcd74ed?embed=1&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

« previous
1
…
4
5
6
7
8
next »

2018
Mark Clique is hard on average for regular resolution
Atserias, Albert ; Bonacina, Ilario ; De Rezende, Susanna F. ^LU ; Lauria, Massimo ; Nordström, Jakob ^LU and Razborov, Alexander (2018) 50th Annual ACM Symposium on Theory of Computing, STOC 2018 In Proceedings of the Annual ACM Symposium on Theory of Computing p.646-659
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2017
Mark Cumulative space in black-white pebbling and resolution
Alwen, Joël ; De Rezende, Susanna F. ^LU ; Nordström, Jakob ^LU and Vinyals, Marc (2017) 8th Innovations in Theoretical Computer Science Conference, ITCS 2017 In Leibniz International Proceedings in Informatics, LIPIcs 67.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Graph colouring is hard for algorithms based on hilbert's nullstellensatz and gröbner bases
Lauria, Massimo and Nordström, Jakob ^LU (2017) 32nd Computational Complexity Conference, CCC 2017 In Leibniz International Proceedings in Informatics, LIPIcs 79.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark CNFgen : A generator of crafted benchmarks
Lauria, Massimo ; Elffers, Jan ^LU ; Nordström, Jakob ^LU and Vinyals, Marc (2017) 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017 In Lecture Notes in Computer Science 10491. p.464-473
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Tight Size-Degree Bounds for Sums-of-Squares Proofs
Lauria, Massimo and Nordström, Jakob ^LU (2017) In Computational Complexity 26(4). p.911-948
- Contribution to journal › Article
2016
Mark Supercritical space-width trade-offs for resolution
Berkholz, Christoph and Nordström, Jakob ^LU (2016) 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 In Leibniz International Proceedings in Informatics, LIPIcs 55.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity)
De Rezende, Susanna F. ^LU ; Nordstrom, Jakob ^LU and Vinyals, Marc (2016) 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016-December. p.295-304
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler - Leman Refinement Steps
Berkholz, Christoph and Nordström, Jakob ^LU (2016) 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2016 In Proceedings - Symposium on Logic in Computer Science 05-08-July-2016. p.267-276
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Trade-offs between time and memory in a tighter model of CDCL SAT solvers
Elffers, Jan ^LU ; Johannsen, Jan ; Lauria, Massimo ; Magnard, Thomas ; Nordström, Jakob ^LU and Vinyals, Marc (2016) 19th International Conference on Theory and Applications of Satisfiability Testing, SAT 2016 In Lecture Notes in Computer Science 9710. p.160-176
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Narrow proofs may be maximally long
Atserias, Albert ; Lauria, Massimo and Nordström, Jakob ^LU (2016) In ACM Transactions on Computational Logic 17(3).
- Contribution to journal › Article

« previous
1
…
4
5
6
7
8
next »