Obserwuj
Marc Vinyals
Marc Vinyals
Saint Petersburg State University
Zweryfikowany adres z cs.technion.ac.il - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
CNFgen: A generator of crafted benchmarks
M Lauria, J Elffers, J Nordström, M Vinyals
International Conference on Theory and Applications of Satisfiability …, 2017
292017
Towards an understanding of polynomial calculus: New separations and lower bounds
Y Filmus, M Lauria, M Mikša, J Nordström, M Vinyals
International Colloquium on Automata, Languages, and Programming, 437-448, 2013
292013
From small space to small width in resolution
Y Filmus, M Lauria, M Mikša, J Nordström, M Vinyals
ACM Transactions on Computational Logic (TOCL) 16 (4), 1-15, 2015
252015
In between resolution and cutting planes: A study of proof systems for pseudo-Boolean SAT solving
M Vinyals, J Elffers, J Giráldez-Cru, S Gocht, J Nordström
International Conference on Theory and Applications of Satisfiability …, 2018
242018
Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers
J Elffers, J Giráldez-Cru, J Nordström, M Vinyals
International Conference on Theory and Applications of Satisfiability …, 2018
222018
How limited interaction hinders real communication (and what it means for proof and circuit complexity)
SF De Rezende, J Nordström, M Vinyals
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
212016
Hardness of approximation in PSPACE and separation results for pebble games
SM Chan, M Lauria, J Nordstrom, M Vinyals
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 466-485, 2015
202015
Trade-offs between time and memory in a tighter model of CDCL SAT solvers
J Elffers, J Johannsen, M Lauria, T Magnard, J Nordström, M Vinyals
International Conference on Theory and Applications of Satisfiability …, 2016
132016
Cumulative space in black-white pebbling and resolution
JF Alwen, S De Rezende, J Nordstrom, M Vinyals
112017
Complexity measures on the symmetric group and beyond
N Dafni, Y Filmus, N Lifshitz, N Lindzey, M Vinyals
arXiv preprint arXiv:2010.07405, 2020
92020
Hard examples for common variable decision heuristics
M Vinyals
Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 1652-1659, 2020
82020
Equality alone does not simulate randomness
A Chattopadhyay, S Lovett, M Vinyals
34th Computational Complexity Conference (CCC 2019), 2019
72019
Lifting with simple gadgets and applications to circuit and proof complexity
S De Rezende, O Meir, J Nordström, T Pitassi, R Robere, M Vinyals
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 24-30, 2020
62020
Maxsat resolution and subcube sums
Y Filmus, M Mahajan, G Sood, M Vinyals
International Conference on Theory and Applications of Satisfiability …, 2020
62020
Towards a Complexity-theoretic Understanding of Restarts in SAT solvers
C Li, N Fleming, M Vinyals, T Pitassi, V Ganesh
International Conference on Theory and Applications of Satisfiability …, 2020
52020
Simplified and improved separations between regular and general resolution by lifting
M Vinyals, J Elffers, J Johannsen, J Nordström
International Conference on Theory and Applications of Satisfiability …, 2020
42020
Complexity Measures on the Symmetric Group and Beyond
N Dafni, Y Filmus, N Lifshitz, N Lindzey, M Vinyals
Master’s thesis, Technion—Israel Institute of Technology, 2022
12022
On the Hierarchical Community Structure of Practical Boolean Formulas
C Li, J Chung, S Mukherjee, M Vinyals, N Fleming, A Kolokolova, A Mu, ...
International Conference on Theory and Applications of Satisfiability …, 2021
12021
On the hierarchical community structure of practical sat formulas
C Li, J Chung, S Mukherjee, M Vinyals, N Fleming, A Kolokolova, A Mu, ...
arXiv preprint arXiv:2103.14992, 2021
12021
Space in Proof Complexity
M Vinyals
KTH Royal Institute of Technology, 2017
12017
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20