LIPIcs, Volume 264, CCC 2023

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