( en | de | ru )

 

Disambiguation of "Nordström, Jakob"

Author of the publication

copydeleteadd this publication to your clipboard
Clique Is Hard on Average for Regular Resolution.

, , , , , and . J. ACM, 68 (4): 23:1-23:26 (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jakob Nordström

Rabbe Nordström

Ludwig Nordström

Fredrik Nordström

Franziska Ulrike Nordström

 

Other publications of authors with the same name

Trade-Offs Between Size and Degree in Polynomial Calculus., , , and . ITCS, volume 151 of LIPIcs, page 72:1-72:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Theory and Practice of SAT and Combinatorial Solving (Dagstuhl Seminar 22411)., , , , and . Dagstuhl Reports, 12 (10): 84-105 (October 2022)Clique Is Hard on Average for Regular Resolution., , , , , and . CoRR, (2020)Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity., , , , , and . FOCS, page 24-30. IEEE, (2020)Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity., , , , and . Electron. Colloquium Comput. Complex., (2019)Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling., , , and . Electron. Colloquium Comput. Complex., (2020)How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity)., , and . Electron. Colloquium Comput. Complex., (2021)Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs., , , and . CoRR, (2019)Experimental Repository for "Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning"., , , , and . (September 2020)On Division Versus Saturation in Pseudo-Boolean Solving., , and . IJCAI, page 1711-1718. ijcai.org, (2019)