default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID40th CCC 2025: Toronto, ON, Canada
- Srikanth Srinivasan
:
40th Computational Complexity Conference, CCC 2025, Toronto, Canada, August 5-8, 2025. LIPIcs 339, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2025, ISBN 978-3-95977-379-9 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xiv
- Omri Gotlib, Tali Kaufman, Shachar Lovett:
List Decoding Quotient Reed-Muller Codes. 1:1-1:44 - Yunqi Li, Prashant Nalini Vasudevan:
Hardness Amplification for Real-Valued Functions. 2:1-2:25 - Daniel Grier, Jackson Morris:
Quantum Threshold Is Powerful. 3:1-3:23 - Jaroslaw Blasiok, Linus Meierhöfer:
Hardness of Clique Approximation for Monotone Circuits. 4:1-4:20 - Simon C. Marshall, Scott Aaronson, Vedran Dunjko:
Improved Separation Between Quantum and Classical Computers for Sampling and Functional Tasks. 5:1-5:14 - Zhiyang Xun, David Zuckerman:
Near-Optimal Averaging Samplers and Matrix Samplers. 6:1-6:28 - Yotam Dikstein, Siqi Liu, Avi Wigderson:
Sparser Abelian High Dimensional Expanders. 7:1-7:98 - Klim Efremenko, Dmitry Itsykson:
Amortized Closure and Its Applications in Lifting for Resolution over Parities. 8:1-8:24 - Chin Ho Lee, Emanuele Viola:
Pseudorandom Bits for Non-Commutative Programs. 9:1-9:22 - Subhash Khot, Kunal Mittal:
Biased Linearity Testing in the 1% Regime. 10:1-10:23 - Jeff Xu:
Switching Graph Matrix Norm Bounds: From i.i.d. to Random Regular Graphs. 11:1-11:23 - David Miloschewsky, Supartha Podder:
New Lower-Bounds for Quantum Computation with Non-Collapsing Measurements. 12:1-12:23 - Meghal Gupta, Venkatesan Guruswami, Mihir Singhal:
Tight Bounds for Stream Decodable Error-Correcting Codes. 13:1-13:17 - Gaia Carenini, Susanna F. de Rezende:
On the Automatability of Tree-Like k-DNF Resolution. 14:1-14:21 - Robert Andrews:
Algebraic Pseudorandomness in VNC⁰. 15:1-15:15 - Tyler Besselman, Mika Göös, Siyao Guo, Gilbert Maystre, Weiqiang Yuan:
Direct Sums for Parity Decision Trees. 16:1-16:38 - François Le Gall, Yupan Liu, Harumichi Nishimura, Qisheng Wang:
Space-Bounded Quantum Interactive Proof Systems. 17:1-17:18 - Simon Apers, Roman Edenhofer:
Directed st-Connectivity with Few Paths Is in Quantum Logspace. 18:1-18:15 - Cassandra Marcussen, Aaron Putterman, Salil P. Vadhan:
Characterizing the Distinguishability of Product Distributions Through Multicalibration. 19:1-19:19 - John M. Hitchcock, Adewale Sekoni, Hadi Shafei:
Counting Martingales for Measure and Dimension in Complexity Classes. 20:1-20:35 - Shubhangi Saraf, Devansh Shringi:
Reconstruction of Depth 3 Arithmetic Circuits with Top Fan-In 3. 21:1-21:22 - Ronen Shaltiel:
Multiplicative Extractors for Samplable Distributions. 22:1-22:22 - Boning Meng, Juqiu Wang, Mingji Xia, Jiayi Zheng:
From an Odd Arity Signature to a Holant Dichotomy. 23:1-23:20 - Arkadev Chattopadhyay, Pavel Dvorák:
Super-Critical Trade-Offs in Resolution over Parities via Lifting. 24:1-24:19 - Louis Golowich, Venkatesan Guruswami:
Quantum LDPC Codes of Almost Linear Distance via Iterated Homological Products. 25:1-25:11 - Maxim van den Berg, Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Vladimir Lysikov:
Algebraic Metacomplexity and Representation Theory. 26:1-26:35 - Irit Dinur, Siqi Liu, Rachel Yun Zhang:
New Codes on High Dimensional Expanders. 27:1-27:42 - Noah Fleming, Deniz Imrek, Christophe Marciot:
Provably Total Functions in the Polynomial Hierarchy. 28:1-28:40 - Yaroslav Alekseev, Mika Göös, Ziyi Guan, Gilbert Maystre, Artur Riazanov, Dmitry Sokolov, Weiqiang Yuan:
Generalised Linial-Nisan Conjecture Is False for DNFs. 29:1-29:13 - Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman:
Online Condensing of Unpredictable Sources via Random Walks. 30:1-30:17 - Marshall Ball, Lijie Chen, Roei Tell:
Towards Free Lunch Derandomization from Necessary Assumptions (And OWFs). 31:1-31:20 - Anastasia Sofronova, Dmitry Sokolov:
A Lower Bound for k-DNF Resolution on Random CNF Formulas via Expansion. 32:1-32:27 - Mi-Ying (Miryam) Huang, Xinyu Mao, Shuo Wang, Guangxu Yang, Jiapeng Zhang:
A Min-Entropy Approach to Multi-Party Communication Lower Bounds. 33:1-33:29 - Halley Goldberg, Valentine Kabanets:
Witness Encryption and NP-Hardness of Learning. 34:1-34:43 - Oliver Korten, Rahul Santhanam:
How to Construct Random Strings. 35:1-35:32 - Susanna F. de Rezende, Marc Vinyals:
Lifting with Colourful Sunflowers. 36:1-36:19
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 2025-12-01 23:10 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:
