| 2023 | 38th Computational Complexity Conference, CCC 2023, Warwick, UK, July 17-20, 2023 Amnon Ta-Shma |
| 2023 | A Degree 4 Sum-Of-Squares Lower Bound for the Clique Number of the Paley Graph. Dmitriy Kunisky, Xifan Yu |
| 2023 | A Distribution Testing Oracle Separating QMA and QCMA. Anand Natarajan, Chinmay Nirkhe |
| 2023 | A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs. Tommaso d'Orsi, Luca Trevisan |
| 2023 | An Algorithmic Approach to Uniform Lower Bounds. Rahul Santhanam |
| 2023 | An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree. Andris Ambainis, Aleksandrs Belovs |
| 2023 | An Improved Trickle down Theorem for Partite Complexes. Dorna Abdolazimi, Shayan Oveis Gharan |
| 2023 | Border Complexity of Symbolic Determinant Under Rank One Restriction. Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj |
| 2023 | Bounded Relativization. Shuichi Hirahara, Zhenjian Lu, Hanlin Ren |
| 2023 | Colourful TFNP and Propositional Proofs. Ben Davis, Robert Robere |
| 2023 | Constant-Depth Circuits vs. Monotone Circuits. Bruno Pasqualotto Cavalar, Igor C. Oliveira |
| 2023 | Criticality of AC⁰-Formulae. Prahladh Harsha, Tulasimohan Molli, Ashutosh Shankar |
| 2023 | Derandomization with Minimal Memory Footprint. Dean Doron, Roei Tell |
| 2023 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2023 | Generative Models of Huge Objects. Lunjia Hu, Inbal Livni Navon, Omer Reingold |
| 2023 | Hardness Against Linear Branching Programs and More. Eshan Chattopadhyay, Jyun-Jie Liao |
| 2023 | Improved Learning from Kolmogorov Complexity. Halley Goldberg, Valentine Kabanets |
| 2023 | Instance-Wise Hardness Versus Randomness Tradeoffs for Arthur-Merlin Protocols. Dieter van Melkebeek, Nicollas M. Sdroievski |
| 2023 | Leakage-Resilient Hardness vs Randomness. Yanyi Liu, Rafael Pass |
| 2023 | Lower Bounds for Polynomial Calculus with Extension Variables over Finite Fields. Russell Impagliazzo, Sasank Mouli, Toniann Pitassi |
| 2023 | Matrix Multiplication and Number on the Forehead Communication. Josh Alman, Jaroslaw Blasiok |
| 2023 | Near-Optimal Set-Multilinear Formula Lower Bounds. Deepanshu Kush, Shubhangi Saraf |
| 2023 | New Lower Bounds Against Homogeneous Non-Commutative Circuits. Prerona Chatterjee, Pavel Hrubes |
| 2023 | New Sampling Lower Bounds via the Separator. Emanuele Viola |
| 2023 | On Correlation Bounds Against Polynomials. Peter Ivanov, Liam Pavlovic, Emanuele Viola |
| 2023 | On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu |
| 2023 | On the Algebraic Proof Complexity of Tensor Isomorphism. Nicola Galesi, Joshua A. Grochow, Toniann Pitassi, Adrian She |
| 2023 | On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation. Nai-Hui Chia, Kai-Min Chung, Yao-Ching Hsieh, Han-Hsuan Lin, Yao-Ting Lin, Yu-Ching Shen |
| 2023 | Radical Sylvester-Gallai Theorem for Tuples of Quadratics. Abhibhav Garg, Rafael Oliveira, Shir Peleg, Akash Kumar Sengupta |
| 2023 | Reducing Tarski to Unique Tarski (In the Black-Box Model). Xi Chen, Yuhao Li, Mihalis Yannakakis |
| 2023 | Separation of the Factorization Norm and Randomized Communication Complexity. Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley |
| 2023 | Spectral Expanding Expanders. Gil Cohen, Itay Cohen |
| 2023 | Sum-Of-Squares Lower Bounds for the Minimum Circuit Size Problem. Per Austrin, Kilian Risse |
| 2023 | The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate. Lennart Bittel, Sevag Gharibian, Martin Kliesch |
| 2023 | Tight Correlation Bounds for Circuits Between AC0 and TC0. Vinayak M. Kumar |
| 2023 | Towards Optimal Depth-Reductions for Algebraic Formulas. Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas |
| 2023 | Trade-Offs Between Entanglement and Communication. Srinivasan Arunachalam, Uma Girish |
| 2023 | Translationally Invariant Constraint Optimization Problems. Dorit Aharonov, Sandy Irani |