default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 38 matches
- 2024
- Michael A. Forbes:
Low-Depth Algebraic Circuit Lower Bounds over Any Field. CCC 2024: 31:1-31:16 - Xin Li, Yan Zhong:
Explicit Directional Affine Extractors and Improved Hardness for Linear Branching Programs. CCC 2024: 10:1-10:14 - Hugo Aaronson, Tom Gur
, Ninad Rajgopal, Ron D. Rothblum:
Distribution-Free Proofs of Proximity. CCC 2024: 24:1-24:18 - Yaroslav Alekseev, Yuval Filmus, Alexander Smal:
Lifting Dichotomies. CCC 2024: 9:1-9:18 - Josh Alman, Yunfeng Guan:
Finer-Grained Hardness of Kernel Density Estimation. CCC 2024: 35:1-35:21 - Noel Arteche, Gaia Carenini, Matthew Gray:
Quantum Automating TC⁰-Frege Is LWE-Hard. CCC 2024: 15:1-15:25 - Sepehr Assadi, Prantar Ghosh, Bruno Loff, Parth Mittal, Sagnik Mukhopadhyay:
Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy. CCC 2024: 7:1-7:16 - Mitali Bafna, Dor Minzer:
Solving Unique Games over Globally Hypercontractive Graphs. CCC 2024: 3:1-3:15 - Sreejata Kishor Bhattacharya, Arkadev Chattopadhyay, Pavel Dvorák:
Exponential Separation Between Powers of Regular and General Resolution over Parities. CCC 2024: 23:1-23:32 - Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan:
A Strong Direct Sum Theorem for Distributional Query Complexity. CCC 2024: 16:1-16:30 - Adam Bouland, Bill Fefferman, Soumik Ghosh, Tony Metger, Umesh V. Vazirani, Chenyi Zhang, Zixin Zhou:
Public-Key Pseudoentanglement and the Hardness of Learning Ground State Entanglement Structure. CCC 2024: 21:1-21:23 - Peter Bürgisser, Mahmut Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson:
Complexity of Robust Orbit Problems for Torus Actions and the abc-Conjecture. CCC 2024: 14:1-14:48 - Amit Chakrabarti, Manuel Stoeckl:
Finding Missing Items Requires Strong Forms of Randomness. CCC 2024: 28:1-28:20 - Prerona Chatterjee, Deepanshu Kush, Shubhangi Saraf, Amir Shpilka:
Lower Bounds for Set-Multilinear Branching Programs. CCC 2024: 20:1-20:20 - Kuan Cheng, Yichuan Wang:
BPL ⊆ L-AC¹. CCC 2024: 32:1-32:14 - Gil Cohen, Tal Yankovitz:
Asymptotically-Good RLCCs with (log n)(2+o(1)) Queries. CCC 2024: 8:1-8:16 - Joshua Cook, Dana Moshkovitz:
Explicit Time and Space Efficient Encoders Exist Only with Random Access. CCC 2024: 5:1-5:54 - Graham Cormode, Marcel Dall'Agnol, Tom Gur, Chris Hickey:
Streaming Zero-Knowledge Proofs. CCC 2024: 2:1-2:66 - Harm Derksen, Peter Ivanov, Chin Ho Lee, Emanuele Viola:
Pseudorandomness, Symmetry, Smoothing: I. CCC 2024: 18:1-18:27 - Yangjing Dong, Honghao Fu, Anand Natarajan, Minglong Qin, Haochen Xu, Penghui Yao:
The Computational Advantage of MIP∗ Vanishes in the Presence of Noise. CCC 2024: 30:1-30:71 - Klim Efremenko, Gillat Kol, Dmitry Paramonov, Ran Raz, Raghuvansh R. Saxena:
Information Dissemination via Broadcasts in the Presence of Adversarial Noise. CCC 2024: 19:1-19:33 - Michal Garlík:
Failure of Feasible Disjunction Property for k-DNF Resolution and NP-Hardness of Automating It. CCC 2024: 33:1-33:23 - Sabee Grewal, Justin Yirka:
The Entangled Quantum Polynomial Hierarchy Collapses. CCC 2024: 6:1-6:23 - Mohit Gurumukhani, Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Navid Talebanfard:
Local Enumeration and Majority Lower Bounds. CCC 2024: 17:1-17:25 - Venkatesan Guruswami, Xuandi Ren, Sai Sandeep:
Baby PIH: Parameterized Inapproximability of Min CSP. CCC 2024: 27:1-27:17 - Shuichi Hirahara, Valentine Kabanets, Zhenjian Lu, Igor C. Oliveira:
Exact Search-To-Decision Reductions for Time-Bounded Kolmogorov Complexity. CCC 2024: 29:1-29:56 - Justin Holmgren, Ron Rothblum:
Linear-Size Boolean Circuits for Multiselection. CCC 2024: 11:1-11:20 - William M. Hoza:
A Technique for Hardness Amplification Against AC⁰. CCC 2024: 1:1-1:20 - Pavel Hrubes:
A Subquadratic Upper Bound on Sum-Of-Squares Composition Formulas. CCC 2024: 12:1-12:11 - Pavel Hrubes:
Hard Submatrices for Non-Negative Rank and Communication Complexity. CCC 2024: 13:1-13:12
skipping 8 more matches
loading more results 
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-04 00:56 CET from data curated 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:
