1 – 10 of 18
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2026
-
Mark
Total search problems in ZPP
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Sensitivity Lower Bounds for Approximation Algorithms
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2025
-
Mark
Truly Supercritical Trade-Offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler–Leman
(2025) 57th Annual ACM Symposium on Theory of Computing, STOC 2025 In Proceedings of the Annual ACM Symposium on Theory of Computing p.1371-1382
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Provably total functions in the polynomial hierarchy
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2024
-
Mark
Black-Box PPP Is Not Turing-Closed
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2023
-
Mark
Limits of CDCL learning via merge resolution
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
TFNP characterizations of proof systems and monotone circuits
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2022
-
Mark
Low degree testing over the reals
(2022) p.738-792
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
On semi-algebraic proofs and algorithms
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Random Θ(log n)-CNFs are hard for Cutting Planes
- Contribution to journal › Article
