default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Complexity, Volume 34
Volume 34, Number 1, June 2025
- Ninad Rajgopal, Rahul Santhanam:
On the Structure of Learnability beyond P/poly. 1 - François Le Gall:
Robust Dequantization of the Quantum Singular Value Transformation and Quantum Machine Learning Algorithms. 2 - Supartha Podder, Penghui Yao, Zekun Ye:
On the Fine-Grained Query Complexity of Symmetric Functions. 3 - Matthias Christandl, François Le Gall, Vladimir Lysikov
, Jeroen Zuiddam:
Barriers for rectangular matrix multiplication. 4 - François Le Gall:
Correction: Robust dequantization of the quantum singular value transformation and quantum machine learning algorithms. 5 - Ján Pich:
Learning algorithms from circuit lower bounds. 6 - Pranav Bisht, Ilya Volkovich:
On Solving Sparse Polynomial Factorization Related Problems. 7
Volume 34, Number 2, December 2025
- Amey Bhangale, Subhash Khot, Dor Minzer:
On approximability of Satisfiable k-CSPs: I. 8 - Pavel Hrubes:
Hard submatrices for non-negative rank and communication complexity. 9 - Vikraman Arvind, Pushkar S. Joglekar:
On Efficient Noncommutative Polynomial Factorization via Higman Linearization. 10 - Yupan Liu:
Quantum state testing beyond the polarizing regime and quantum triangular discrimination. 11 - Md Lutfar Rahman, Thomas Watson:
Tractable Unordered 3-CNF Games. 12 - Edward Pyne:
Derandomizing Logspace With a Small Shared Hard Drive. 13 - Andris Ambainis, Aleksandrs Belovs:
An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree. 14 - Dieter van Melkebeek, Nicollas M. Sdroievski:
Instance-Wise Hardness and Refutation versus Derandomization for Arthur-Merlin Protocols. 15 - Noel Arteche, Gaia Carenini, Matthew Gray:
Quantum Automating TC0-Frege Is LWE-Hard. 16 - Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley:
Separation of the Factorization Norm and Randomized Communication Complexity. 17 - Yaroslav Alekseev, Yuval Filmus, Alexander V. Smal:
Lifting Dichotomies. 18 - Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky:
On a Hierarchy of Spectral Isomorphism Invariants. 19 - Arkadev Chattopadhyay, Yogesh Dahiya, Meena Mahajan:
Pseudo-Deterministic Query Complexity of Search Problems. 20
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-09 23:25 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:
