| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Towards a Theory of Algorithmic Proof Complexity (Invited Talk) | Atserias, Albert | 2022 |
| 2 | Proofs of Soundness and Proof Search (Invited Talk) | Atserias, Albert | 2020 |
| 3 | Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz Proofs | Atserias, Albert et al. | 2019 |
| 4 | Definable Inapproximability: New Challenges for Duplicator | Atserias, Albert et al. | 2018 |
| 5 | On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface | Atserias, Albert et al. | 2018 |
| 6 | Proof Complexity (Dagstuhl Seminar 18051) | Atserias, Albert et al. | 2018 |
| 7 | Proof Complexity Meets Algebra | Atserias, Albert et al. | 2017 |
| 8 | Non-Homogenizable Classes of Finite Structures | Atserias, Albert et al. | 2016 |
| 9 | Bounded-width QBF is PSPACE-complete | Atserias, Albert et al. | 2013 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |