Остановите войну!
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 152 matches
- 2023
- Ruijie Zhao, David B. H. Tay:
A Complex Exponential Structure for Low-Complexity Variable Fractional Delay FIR Filters. Circuits Syst. Signal Process. 42(2): 1105-1141 (2023) - Andris Ambainis, Aleksandrs Belovs:
An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree. CCC 2023: 24:1-24:13 - Ying Liu:
Exponential Time Complexity of the Complex Weighted Boolean #CSP. COCOON (1) 2023: 83-96 - 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 - Xinrui Jia, Ola Svensson, Weiqiang Yuan:
The Exact Bipartite Matching Polytope Has Exponential Extension Complexity. SODA 2023: 1635-1654 - 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) - Zhenyuan Liu, Bart P. G. Van Parys, Henry Lam:
Smoothed f-Divergence Distributionally Robust Optimization: Exponential Rate Efficiency and Complexity-Free Calibration. CoRR abs/2306.14041 (2023) - Sally Dong, Thomas Rothvoss:
Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity. CoRR abs/2307.16159 (2023) - Saptarshi Roy, Ambuj Tewari:
On the Computational Complexity of Private High-dimensional Model Selection via the Exponential Mechanism. CoRR abs/2310.07852 (2023) - 2022
- Gianluigi Pillonetto, Anna Scampicchio:
Sample Complexity and Minimax Properties of Exponentially Stable Regularized Estimators. IEEE Trans. Autom. Control. 67(5): 2330-2342 (2022) - Baturalp Yalcin, Haixiang Zhang, Javad Lavaei, Somayeh Sojoudi:
Factorization Approach for Low-complexity Matrix Completion Problems: Exponential Number of Spurious Solutions and Failure of Gradient Methods. AISTATS 2022: 319-341 - Nicolas Potvin, Hugues Bersini, Dragomir Milojevic:
Espresso to the rescue of genetic programming facing exponential complexity. GECCO Companion 2022: 590-593 - Anders Aamand, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Nicholas Schiefer, Sandeep Silwal, Tal Wagner:
Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks. NeurIPS 2022 - Florian Bruse, David Kronenberger, Martin Lange:
Capturing Bisimulation-Invariant Exponential-Time Complexity Classes. GandALF 2022: 17-33 - Ying Liu:
The Exponential-Time Complexity of the complex weighted #CSP. CoRR abs/2202.02782 (2022) - Varun Kanade, Patrick Rebeschini, Tomas Vaskevicius:
Exponential Tail Local Rademacher Complexity Risk Bounds Without the Bernstein Condition. CoRR abs/2202.11461 (2022) - Fabien Dufoulon, William K. Moses Jr., Gopal Pandurangan:
Sleeping is Superefficient: MIS in Exponentially Better Awake Complexity. CoRR abs/2204.08359 (2022) - Anders Aamand, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Nicholas Schiefer, Sandeep Silwal, Tal Wagner:
Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks. CoRR abs/2211.03232 (2022) - Michael J. Bremner, Zhengfeng Ji, Xingjian Li, Luke Mathieson, Mauro E. S. Morales:
Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis. CoRR abs/2211.05325 (2022) - Xinrui Jia, Ola Svensson, Weiqiang Yuan:
The Exact Bipartite Matching Polytope Has Exponential Extension Complexity. CoRR abs/2211.09106 (2022) - 2021
- Hui Li, Wei Zhou, Tong Chu:
Stability, Multistability, and Complexity Analysis in a Dynamic Duopoly Game with Exponential Demand Function. Complex. 2021: 9978320:1-9978320:16 (2021) - Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman:
The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems. Theor. Comput. Sci. 892: 1-24 (2021) - Arkopal Dutt, Andrey Y. Lokhov, Marc Vuffray, Sidhant Misra:
Exponential Reduction in Sample Complexity with Learning of Ising Model Dynamics. ICML 2021: 2914-2925 - Stepan L. Kuznetsov:
Complexity of a Fragment of Infinitary Action Logic with Exponential via Non-well-founded Proofs. TABLEAUX 2021: 317-334 - Arkopal Dutt, Andrey Y. Lokhov, Marc Vuffray, Sidhant Misra:
Exponential Reduction in Sample Complexity with Learning of Ising Model Dynamics. CoRR abs/2104.00995 (2021) - Arthur G. Rattew, Marco Pistoia:
On the Exponential Sample Complexity of the Quantum State Sign Estimation Problem. CoRR abs/2108.03193 (2021) - Baturalp Yalcin, Haixiang Zhang, Javad Lavaei, Somayeh Sojoudi:
Factorization Approach for Low-complexity Matrix Completion Problems: Exponential Number of Spurious Solutions and Failure of Gradient Methods. CoRR abs/2110.10279 (2021) - 2019
- Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie:
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. SIAM J. Comput. 48(1): 122-143 (2019) - Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan:
Exponential Separations in the Energy Complexity of Leader Election. ACM Trans. Algorithms 15(4): 49:1-49:31 (2019) - Yuheng Bu, Shaofeng Zou, Venugopal V. Veeravalli:
Linear-Complexity Exponentially-Consistent Tests for Universal Outlying Sequence Detection. IEEE Trans. Signal Process. 67(8): 2115-2128 (2019)
skipping 122 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-04-23 14:14 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