Jakob Nordström
21 – 30 of 72
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2021
-
Mark
Automating algebraic proof systems is NP-hard
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
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
(
- Contribution to journal › Article
-
Mark
Learn to relax : Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search
(
- Contribution to journal › Article
- 2020
-
Mark
Lifting with simple gadgets and applications to circuit and proof complexity
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
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
Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning
2020) 20th International Conference on Formal Methods in Computer-Aided Design, FMCAD 2020 In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, FMCAD 2020 p.194-204(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Using Resolution Proofs to Analyse CDCL Solvers
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
-
Mark
Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models
2020) 26th International Conference on Principles and Practice of Constraint Programming, CP 2020 In Lecture Notes in Computer Science 12333. p.917-934(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems
2020) 26th International Conference on Principles and Practice of Constraint Programming, CP 2020 In Lecture Notes in Computer Science 12333. p.338-357(
- 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
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