( en | de | ru )

 

Disambiguation of "Vinyals, Marc"

Author of the publication

copydeleteadd this publication to your clipboard
Proving Unsatisfiability with Hitting Formulas.

, , , , and . CoRR, (2023)

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.

Marc Vinyals

Oriol Vinyals

Stefanie Marczoch

Langzeitverlauf von 200 Patienten mit kraniofazialen und zervikalen Dystonien bis zu 12 Jahre nach der ersten Botulinumtoxin-Behandlung. TU München, (2009)

Hans-Peter Marchal

Erna Marcus

 

Other publications of authors with the same name

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity., , , , , and . FOCS, page 24-30. IEEE, (2020)Proving Unsatisfiability with Hitting Formulas., , , , and . ITCS, volume 287 of LIPIcs, page 48:1-48:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Hard Examples for Common Variable Decision Heuristics.. AAAI, page 1652-1659. AAAI Press, (2020)Limits of CDCL Learning via Merge Resolution., , , , and . SAT, volume 271 of LIPIcs, page 27:1-27:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers., , , , and . SAT, volume 12178 of Lecture Notes in Computer Science, page 233-249. Springer, (2020)Proving Unsatisfiability with Hitting Formulas., , , , and . CoRR, (2023)Irreducible Subcube Partitions., , , , , , and . Electron. J. Comb., (2023)Simplified and Improved Separations Between Regular and General Resolution by Lifting., , , and . SAT, volume 12178 of Lecture Notes in Computer Science, page 182-200. Springer, (2020)MaxSAT Resolution and Subcube Sums., , , and . SAT, volume 12178 of Lecture Notes in Computer Science, page 295-311. Springer, (2020)How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity)., , and . Electron. Colloquium Comput. Complex., (2021)