Jakob Nordström

1 – 10 of 58

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/ja2884no?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
6
next »

2022
Mark An Auditable Constraint Programming Solver
Gocht, Stephan ^LU ; McCreesh, Ciaran and Nordström, Jakob ^LU (2022) 28th International Conference on Principles and Practice of Constraint Programming, CP 2022 In Leibniz International Proceedings in Informatics, LIPIcs 235.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Certified CNF Translations for Pseudo-Boolean Solving
Gocht, Stephan ^LU ; Martins, Ruben ; Nordström, Jakob ^LU and Oertel, Andy ^LU (2022) 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022) In Leibniz International Proceedings in Informatics (LIPIcs) 236.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Adding Dual Variables to Algebraic Reasoning for Gate-Level Multiplier Verification
Kaufmann, Daniela ; Beame, Paul ; Biere, Armin and Nordstrom, Jakob ^LU (2022) 2022 Design, Automation and Test in Europe Conference and Exhibition, DATE 2022 In Proceedings of the 2022 Design, Automation and Test in Europe Conference and Exhibition, DATE 2022 p.1431-1436
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2021
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 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 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 (2021) In Journal of the ACM 68(4). p.1-26
- Contribution to journal › Article
Mark Proof complexity and SAT solving
Buss, Sam and Nordström, Jakob ^LU (2021) p.233-350
- Chapter in Book/Report/Conference proceeding › Book chapter
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
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
2020
Mark Using Resolution Proofs to Analyse CDCL Solvers
Kokkala, Janne I. ^LU and Nordström, Jakob ^LU (2020) 26th International Conference on Principles and Practice of Constraint Programming, CP 2020 In Lecture Notes in Computer Science 12333. p.427-444
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding

« previous
1
2
3
4
5
6
next »