Author of the publication

Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling.

, , , and . CCC, volume 137 of LIPIcs, page 18:1-18:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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.

 

Other publications of authors with the same name

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)Clique Is Hard on Average for Regular Resolution., , , , , and . J. ACM, 68 (4): 23:1-23:26 (2021)Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs., , , and . CCC, volume 169 of LIPIcs, page 28:1-28:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling., , , and . CCC, volume 137 of LIPIcs, page 18:1-18:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)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)KRW Composition Theorems via Lifting., , , , and . FOCS, page 43-49. IEEE, (2020)Clique Is Hard on Average for Unary Sherali-Adams., , and . FOCS, page 12-25. IEEE, (2023)Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz., , , , and . FOCS, page 1-11. IEEE, (2023)