1 – 2 of 2
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 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
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