default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID38th CCC 2023: Warwick, UK
- Amnon Ta-Shma
:
38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK. LIPIcs 264, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-282-2 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:14
- Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley:
Separation of the Factorization Norm and Randomized Communication Complexity. 1:1-1:16 - Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj:
Border Complexity of Symbolic Determinant Under Rank One Restriction. 2:1-2:15 - Peter Ivanov, Liam Pavlovic, Emanuele Viola:
On Correlation Bounds Against Polynomials. 3:1-3:35 - Nicola Galesi, Joshua A. Grochow, Toniann Pitassi, Adrian She:
On the Algebraic Proof Complexity of Tensor Isomorphism. 4:1-4:40 - Lunjia Hu, Inbal Livni Navon, Omer Reingold:
Generative Models of Huge Objects. 5:1-5:20 - Shuichi Hirahara, Zhenjian Lu, Hanlin Ren:
Bounded Relativization. 6:1-6:45 - Russell Impagliazzo, Sasank Mouli, Toniann Pitassi:
Lower Bounds for Polynomial Calculus with Extension Variables over Finite Fields. 7:1-7:24 - Gil Cohen, Itay Cohen:
Spectral Expanding Expanders. 8:1-8:19 - Eshan Chattopadhyay, Jyun-Jie Liao:
Hardness Against Linear Branching Programs and More. 9:1-9:27 - Dorna Abdolazimi, Shayan Oveis Gharan:
An Improved Trickle down Theorem for Partite Complexes. 10:1-10:16 - Dean Doron, Roei Tell:
Derandomization with Minimal Memory Footprint. 11:1-11:15 - Halley Goldberg, Valentine Kabanets:
Improved Learning from Kolmogorov Complexity. 12:1-12:29 - Prerona Chatterjee, Pavel Hrubes:
New Lower Bounds Against Homogeneous Non-Commutative Circuits. 13:1-13:10 - Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu:
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. 14:1-14:25 - Deepanshu Kush, Shubhangi Saraf:
Near-Optimal Set-Multilinear Formula Lower Bounds. 15:1-15:33 - Josh Alman, Jaroslaw Blasiok:
Matrix Multiplication and Number on the Forehead Communication. 16:1-16:23 - Dieter van Melkebeek, Nicollas M. Sdroievski:
Instance-Wise Hardness Versus Randomness Tradeoffs for Arthur-Merlin Protocols. 17:1-17:36 - Vinayak M. Kumar:
Tight Correlation Bounds for Circuits Between AC0 and TC0. 18:1-18:40 - Prahladh Harsha, Tulasimohan Molli, Ashutosh Shankar:
Criticality of AC⁰-Formulae. 19:1-19:24 - Abhibhav Garg, Rafael Oliveira, Shir Peleg, Akash Kumar Sengupta:
Radical Sylvester-Gallai Theorem for Tuples of Quadratics. 20:1-20:30 - Xi Chen, Yuhao Li, Mihalis Yannakakis:
Reducing Tarski to Unique Tarski (In the Black-Box Model). 21:1-21:23 - Anand Natarajan, Chinmay Nirkhe:
A Distribution Testing Oracle Separating QMA and QCMA. 22:1-22:27 - Dorit Aharonov, Sandy Irani:
Translationally Invariant Constraint Optimization Problems. 23:1-23:15 - Andris Ambainis, Aleksandrs Belovs:
An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree. 24:1-24:13 - Srinivasan Arunachalam, Uma Girish:
Trade-Offs Between Entanglement and Communication. 25:1-25:23 - Emanuele Viola:
New Sampling Lower Bounds via the Separator. 26:1-26:23 - Tommaso d'Orsi, Luca Trevisan:
A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs. 27:1-27:16 - Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas:
Towards Optimal Depth-Reductions for Algebraic Formulas. 28:1-28:19 - Bruno Pasqualotto Cavalar, Igor C. Oliveira:
Constant-Depth Circuits vs. Monotone Circuits. 29:1-29:37 - Dmitriy Kunisky, Xifan Yu:
A Degree 4 Sum-Of-Squares Lower Bound for the Clique Number of the Paley Graph. 30:1-30:25 - Per Austrin, Kilian Risse:
Sum-Of-Squares Lower Bounds for the Minimum Circuit Size Problem. 31:1-31:21 - Yanyi Liu, Rafael Pass:
Leakage-Resilient Hardness vs Randomness. 32:1-32:20 - Nai-Hui Chia, Kai-Min Chung, Yao-Ching Hsieh, Han-Hsuan Lin, Yao-Ting Lin, Yu-Ching Shen:
On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation. 33:1-33:45 - Lennart Bittel, Sevag Gharibian, Martin Kliesch:
The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate. 34:1-34:24 - Rahul Santhanam:
An Algorithmic Approach to Uniform Lower Bounds. 35:1-35:26 - Ben Davis, Robert Robere:
Colourful TFNP and Propositional Proofs. 36:1-36:21
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
