1 – 3 of 3
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2025
-
Mark
On the automatability of tree-like k-DNF resolution
Carenini, Gaia and de Rezende, Susanna F. LU
(2025)
40th Computational Complexity Conference, CCC 2025
In LIPIcs : Leibniz international proceedings in informatics
339.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2024
-
Mark
Quantum Automating TC0-Frege Is LWE-Hard
(2024) 39th Computational Complexity Conference, CCC 2024 In Leibniz International Proceedings in Informatics, LIPIcs 300.
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2021
-
Mark
Automating algebraic proof systems is NP-hard
De Rezende, Susanna F. LU
; Göös, Mika
; Nordström, Jakob
LU
; Pitassi, Toniann
; Robere, Robert
and Sokolov, Dmitry
LU
(2021)
53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021
In Proceedings of the Annual ACM Symposium on Theory of Computing
p.209-222
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding