Jakob Nordström

21 – 30 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
2
3
4
5
…
8
next »

2021
Mark The power of negative reasoning
de Rezende, Susanna F. ^LU ; Lauria, Massimo ; Nordström, Jakob ^LU and Sokolov, Dmitry ^LU (2021) 36th Computational Complexity Conference, CCC 2021 In Leibniz International Proceedings in Informatics, LIPIcs 200.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Learn to relax : Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search
Devriendt, Jo ^LU ; Gleixner, Ambros and Nordström, Jakob ^LU (2021) In Constraints 26(44565). p.26-55
- Contribution to journal › Article
Mark Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
De Rezende, Susanna F. ^LU ; Meir, Or ; Nordström, Jakob ^LU and Robere, Robert (2021) In Computational Complexity 30(1).
- Contribution to journal › Article
Mark Automating algebraic proof systems is NP-hard
De Rezende, Susanna F. ^LU ; Göös, Mika ; Nordström, Jakob ^LU ; Pitassi, Toniann ; Robere, Robert and Sokolov, Dmitry ^LU (2021) 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 In Proceedings of the Annual ACM Symposium on Theory of Computing p.209-222
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2020
Mark Lifting with simple gadgets and applications to circuit and proof complexity
De Rezende, Susanna ^LU ; Meir, Or ; Nordstrom, Jakob ^LU ; Pitassi, Toniann ; Robere, Robert and Vinyals, Marc (2020) 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS 2020-November. p.24-30
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark KRW composition theorems via lifting
De Rezende, Susanna F. ^LU ; Meir, Or ; Nordstrom, Jakob ^LU ; Pitassi, Toniann and Robere, Robert (2020) 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020 In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS 2020-November. p.43-49
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
de Rezende, Susanna F. ^LU ; Nordström, Jakob ^LU ; Risse, Kilian and Sokolov, Dmitry ^LU (2020) 35th Computational Complexity Conference, CCC 2020 In Leibniz International Proceedings in Informatics, LIPIcs 169.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Simplified and Improved Separations Between Regular and General Resolution by Lifting
Vinyals, Marc ; Elffers, Jan ^LU ; Johannsen, Jan and Nordström, Jakob ^LU (2020) 23rd International Conference on Theory and Applications of Satisfiability Testing, SAT 2020 In Lecture Notes in Computer Science 12178. p.182-200
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Supercritical space-width trade-offs for resolution
Berkholz, Christoph and Nordström, Jakob ^LU (2020) In SIAM Journal on Computing 49(1). p.98-118
- Contribution to journal › Article
Mark Trade-offs between size and degree in polynomial calculus
Lagarde, Guillaume ; Nordström, Jakob ^LU ; Sokolov, Dmitry ^LU and Swernofsky, Joseph (2020) 11th Innovations in Theoretical Computer Science Conference, ITCS 2020 In Leibniz International Proceedings in Informatics, LIPIcs 151.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding

« previous
1
2
3
4
5
…
8
next »