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
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-04-10 21:06 CEST 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:
