Chethan Kamath, Karen Klein, Krzysztof Pietrzak, 13043, Theory of Cryptography, 2021, 486
Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova, “Bounded-depth Frege complexity of Tseitin formulas for all graphs”, Annals of Pure and Applied Logic, 174, № 1, 2023, 103166
Ludmila Glinskih, Dmitry Itsykson, “On Tseitin Formulas, Read-Once Branching Programs and Treewidth”, Theory Comput Syst, 65, № 3, 2021, 613
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke, “Complexity and Approximability of Parameterized MAX-CSPs”, Algorithmica, 79, № 1, 2017, 230
Nicola Galesi, Navid Talebanfard, Jacobo Torán, 10929, Theory and Applications of Satisfiability Testing – SAT 2018, 2018, 311
Noah Fleming, Toniann Pitassi, 22, Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs, 2022, 497
Illya V. Hicks, Boris Brimkov, “Tangle bases: Revisited”, Networks, 77, № 1, 2021, 161
Jacobo Torán, 7962, Theory and Applications of Satisfiability Testing – SAT 2013, 2013, 52
Paul Beame, Chris Beck, Russell Impagliazzo, “Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds for Superlinear Space”, SIAM J. Comput., 45, № 4, 2016, 1612
Chunxiao Li, Jonathan Chung, Soham Mukherjee, Marc Vinyals, Noah Fleming, Antonina Kolokolova, Alice Mu, Vijay Ganesh, 12831, Theory and Applications of Satisfiability Testing – SAT 2021, 2021, 359