| 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 | 61 | 2016 |
| CNFgen: A generator of crafted benchmarks M Lauria, J Elffers, J Nordström, M Vinyals Theory and Applications of Satisfiability Testing–SAT 2017: 20th …, 2017 | 46 | 2017 |
| 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 | 29 | 2013 |
| 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 Theory and Applications of Satisfiability Testing–SAT 2018: 21st …, 2018 | 28 | 2018 |
| 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 | 26 | 2020 |
| Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers J Elffers, J Giráldez-Cru, J Nordström, M Vinyals Theory and Applications of Satisfiability Testing–SAT 2018: 21st …, 2018 | 25 | 2018 |
| 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 | 24 | 2015 |
| 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 | 23 | 2015 |
| Maxsat resolution and subcube sums Y Filmus, M Mahajan, G Sood, M Vinyals ACM Transactions on Computational Logic 24 (1), 1-27, 2023 | 18 | 2023 |
| Cumulative space in black-white pebbling and resolution J Alwen, SF De Rezende, J Nordström, M Vinyals 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 2017 | 18 | 2017 |
| Equality alone does not simulate randomness A Chattopadhyay, S Lovett, M Vinyals 34th Computational Complexity Conference (CCC 2019), 2019 | 16 | 2019 |
| Hard examples for common variable decision heuristics M Vinyals Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 1652-1659, 2020 | 15 | 2020 |
| 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 Theory and Applications of Satisfiability Testing–SAT 2016: 19th …, 2016 | 15 | 2016 |
| Complexity measures on the symmetric group and beyond N Dafni, Y Filmus, N Lifshitz, N Lindzey, M Vinyals arXiv preprint arXiv:2010.07405, 2020 | 14 | 2020 |
| Towards a Complexity-theoretic Understanding of Restarts in SAT solvers C Li, N Fleming, M Vinyals, T Pitassi, V Ganesh Theory and Applications of Satisfiability Testing–SAT 2020: 23rd …, 2020 | 12 | 2020 |
| On the hierarchical community structure of practical Boolean formulas C Li, J Chung, S Mukherjee, M Vinyals, N Fleming, A Kolokolova, A Mu, ... Theory and Applications of Satisfiability Testing–SAT 2021: 24th …, 2021 | 10 | 2021 |
| Simplified and improved separations between regular and general resolution by lifting M Vinyals, J Elffers, J Johannsen, J Nordström Theory and Applications of Satisfiability Testing–SAT 2020: 23rd …, 2020 | 6 | 2020 |
| Proving Unsatisfiability with Hitting Formulas Y Filmus, EA Hirsch, A Riazanov, A Smal, M Vinyals arXiv preprint arXiv:2302.06241, 2023 | 1 | 2023 |
| Irreducible subcube partitions Y Filmus, E Hirsch, S Kurz, F Ihringer, A Riazanov, A Smal, M Vinyals arXiv preprint arXiv:2212.14685, 2022 | 1 | 2022 |
| 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 | 1 | 2021 |
Jakob NordströmUniversity of Copenhagen and Lund UniversityVerified email at di.ku.dk
