Marc Vinyals

Available identifiers

Publication	Date of Publication	Type
Limits of CDCL learning via merge resolution	2024-11-26	Paper
Irreducible subcube partitions	2024-02-23	Paper
Proving Unsatisfiability with Hitting Formulas	2023-02-13	Paper
MaxSAT Resolution and Subcube Sums	2023-02-07	Paper
Equality alone does not simulate randomness	2022-07-27	Paper
On the hierarchical community structure of practical Boolean formulas	2022-03-22	Paper
Simplified and improved separations between regular and general resolution by lifting	2021-04-07	Paper
Towards a complexity-theoretic understanding of restarts in SAT solvers	2021-04-07	Paper
MaxSAT resolution and subcube sums	2021-04-07	Paper
Complexity Measures on the Symmetric Group and Beyond	2020-10-14	Paper
Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers	2018-08-10	Paper
In between resolution and cutting planes: a study of proof systems for pseudo-Boolean SAT solving	2018-08-10	Paper
Cumulative space in black-white pebbling and resolution	2018-05-03	Paper
From small space to small width in resolution	2017-07-12	Paper
From small space to small width in resolution	2017-03-03	Paper
Trade-offs between time and memory in a tighter model of CDCL SAT solvers	2016-09-05	Paper
Towards an understanding of polynomial calculus: new separations and lower bounds (extended abstract)	2013-08-06	Paper

This page was built for person: Marc Vinyals