Остановите войну!
for scientists:
default search action
Search 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 44 matches
- 2024
- Olaf Beyersdorff, Benjamin Böhm, Meena Mahajan:
Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs. AAAI 2024: 7943-7951 - 2023
- Zhao-Rong Lai, Haisheng Yang:
A Survey on Gaps between Mean-Variance Approach and Exponential Growth Rate Approach for Portfolio Optimization. ACM Comput. Surv. 55(2): 25:1-25:36 (2023) - Zeyu Ding, Yuxin Wang, Yingtai Xiao, Guanhong Wang, Danfeng Zhang, Daniel Kifer:
Free gap estimates from the exponential mechanism, sparse vector, noisy max and related algorithms. VLDB J. 32(1): 23-48 (2023) - Alireza Fathollah Pour, Hassan Ashtiani:
On the Role of Noise in the Sample Complexity of Learning Recurrent Neural Networks: Exponential Gaps for Long Sequences. NeurIPS 2023 - Arthur Braida, Simon Martiel, Ioan Todinca:
Anti-crossings occurrence as exponentially closing gaps in Quantum Annealing. CoRR abs/2304.12872 (2023) - Alireza Fathollah Pour, Hassan Ashtiani:
On the Role of Noise in the Sample Complexity of Learning Recurrent Neural Networks: Exponential Gaps for Long Sequences. CoRR abs/2305.18423 (2023) - 2022
- Pranjal Dutta, Nitin Saxena:
Separated borders: Exponential-gap fanin-hierarchy theorem for approximative depth-3 circuits. FOCS 2022: 200-211 - Dan Navon, Alex M. Bronstein:
Transformer Vs. MLP-Mixer Exponential Expressive Gap For NLP Problems. CoRR abs/2208.08191 (2022) - 2021
- Yuanhao Wang, Ruosong Wang, Sham M. Kakade:
An Exponential Lower Bound for Linearly Realizable MDP with Constant Suboptimality Gap. NeurIPS 2021: 9521-9533 - Yuanhao Wang, Ruosong Wang, Sham M. Kakade:
An Exponential Lower Bound for Linearly-Realizable MDPs with Constant Suboptimality Gap. CoRR abs/2103.12690 (2021) - 2020
- Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan:
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More. SIAM J. Comput. 49(4): 772-810 (2020) - Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer:
Privately Learning Thresholds: Closing the Exponential Gap. COLT 2020: 2263-2285 - Ionel Roventa, Laurentiu Emanuel Temereanca, Tudor Mihai Adrian:
A note on weighted Ingham's inequality for families of exponentials with no gap. ICSTCC 2020: 43-48 - Zeyu Ding, Yuxin Wang, Yingtai Xiao, Guanhong Wang, Danfeng Zhang, Daniel Kifer:
Free Gap Estimates from the Exponential Mechanism, Sparse Vector, Noisy Max and Related Algorithms. CoRR abs/2012.01592 (2020) - 2019
- Krishnamoorthy Dinesh, Jayalal Sarma:
Alternation, sparsity and sensitivity: Bounds and exponential gaps. Theor. Comput. Sci. 771: 71-82 (2019) - Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer:
Privately Learning Thresholds: Closing the Exponential Gap. CoRR abs/1911.10137 (2019) - 2018
- Krishnamoorthy Dinesh, Jayalal Sarma:
Alternation, Sparsity and Sensitivity: Combinatorial Bounds and Exponential Gaps. CALDAM 2018: 260-273 - 2017
- Zuzana Bednárová, Viliam Geffert:
Two double-exponential gaps for automata with a limited pushdown. Inf. Comput. 253: 381-398 (2017) - Benny Applebaum:
Exponentially-Hard Gap-CSP and Local PRG via Local Hardcore Functions. FOCS 2017: 836-847 - Krishnamoorthy Dinesh, Jayalal Sarma:
Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps. CoRR abs/1712.05735 (2017) - Benny Applebaum:
Exponentially-Hard gap-CSP and local PRG via Local Hardcore Functions. Electron. Colloquium Comput. Complex. TR17 (2017) - Krishnamoorthy Dinesh, Jayalal Sarma:
Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- Linwei Xin, David A. Goldberg:
Optimality Gap of Constant-Order Policies Decays Exponentially in the Lead Time for Lost Sales Models. Oper. Res. 64(6): 1556-1565 (2016) - Bill Fefferman, Cedric Yen-Yu Lin:
Quantum Merlin Arthur with Exponentially Small Gap. CoRR abs/1601.01975 (2016) - Irit Dinur:
Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- Berkay Anahtarci, Plamen Djakov:
Asymptotics of spectral gaps of 1D Dirac operator whose potential is a linear combination of two exponential terms. Asymptot. Anal. 92(1-2): 141-160 (2015) - 2014
- Zuzana Bednárová, Viliam Geffert:
Two Double-Exponential Gaps for Automata with a Limited Pushdown. LATA 2014: 113-125 - 2013
- Pierre Fraigniaud, Andrzej Pelc:
Delays Induce an Exponential Memory Gap for Rendezvous in Trees. ACM Trans. Algorithms 9(2): 17:1-17:24 (2013) - Alberto Montina:
Exponential communication gap between weak and strong classical simulations of quantum communication. CoRR abs/1301.3452 (2013) - Xiaoming Sun, Marcos Villagra:
Exponential Quantum-Classical Gaps in Multiparty Nondeterministic Communication Complexity. Electron. Colloquium Comput. Complex. TR13 (2013)
skipping 14 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-05-10 13:19 CEST 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