Marc Vinyals

According to our database, Marc Vinyals authored at least 24 papers between 2013 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

MaxSAT Resolution and Subcube Sums.

Yuval Filmus, Meena Mahajan, Gaurav Sood, Marc Vinyals

ACM Trans. Comput. Log., January, 2023

Limits of CDCL Learning via Merge Resolution.

Noah Fleming, Vijay Ganesh, Antonina Kolokolova, Chunxiao Li, Marc Vinyals

Electron. Colloquium Comput. Complex., 2023

Proving Unsatisfiability with Hitting Formulas.

Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals

Electron. Colloquium Comput. Complex., 2023

Irreducible Subcube Partitions.

Yuval Filmus, Edward A. Hirsch, Sascha Kurz, Ferdinand Ihringer, Artur Ryazanov, Alexander V. Smal, Marc Vinyals

Electron. J. Comb., 2023

2022

Irreducible subcube partitions.

Yuval Filmus, Edward A. Hirsch, Sascha Kurz, Ferdinand Ihringer, Artur Riazanov, Alexander Smal, Marc Vinyals

CoRR, 2022

2021

How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity).

Susanna F. de Rezende, Jakob Nordström, Marc Vinyals

Electron. Colloquium Comput. Complex., 2021

On the Hierarchical Community Structure of Practical SAT Formulas.

Chunxiao Li, Jonathan Chung, Soham Mukherjee, Marc Vinyals, Noah Fleming, Antonina Kolokolova, Alice Mu, Vijay Ganesh

CoRR, 2021

On the Hierarchical Community Structure of Practical Boolean Formulas.

Chunxiao Li, Jonathan Chung, Soham Mukherjee, Marc Vinyals, Noah Fleming, Antonina Kolokolova, Alice Mu, Vijay Ganesh

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Complexity Measures on the Symmetric Group and Beyond (Extended Abstract).

Neta Dafni, Yuval Filmus, Noam Lifshitz, Nathan Lindzey, Marc Vinyals

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020

Complexity Measures on the Symmetric Group and Beyond.

Neta Dafni, Yuval Filmus, Noam Lifshitz, Nathan Lindzey, Marc Vinyals

CoRR, 2020

Simplified and Improved Separations Between Regular and General Resolution by Lifting.

Marc Vinyals, Jan Elffers, Jan Johannsen, Jakob Nordström

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers.

Chunxiao Li, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity.

Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Hard Examples for Common Variable Decision Heuristics.

Marc Vinyals

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2018

Equality Alone Does Not Simulate Randomness.

Arkadev Chattopadhyay, Shachar Lovett, Marc Vinyals

Electron. Colloquium Comput. Complex., 2018

In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving.

Marc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers.

Jan Elffers, Jesús Giráldez-Cru, Jakob Nordström, Marc Vinyals

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

2017

Space in Proof Complexity.

Marc Vinyals

PhD thesis, 2017

CNFgen: A Generator of Crafted Benchmarks.

Massimo Lauria, Jan Elffers, Jakob Nordström, Marc Vinyals

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Cumulative Space in Black-White Pebbling and Resolution.

Joël Alwen, Susanna F. de Rezende, Jakob Nordström, Marc Vinyals

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016

Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers.

Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

2015

From Small Space to Small Width in Resolution.

Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals

ACM Trans. Comput. Log., 2015

Hardness of Approximation in PSPACE and Separation Results for Pebble Games.

Siu Man Chan, Massimo Lauria, Jakob Nordström, Marc Vinyals

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2013

Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract).

Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013