Остановите войну!
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 201 matches
- 2024
- Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio:
Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas. SODA 2024: 4321-4337 - Max Gläser, Marc E. Pfetsch:
Sub-Exponential Lower Bounds for Branch-and-Bound with General Disjunctions via Interpolation. SODA 2024: 3747-3764 - Ying Liu, Shiteng Chen:
Sub-Exponential Time Lower Bounds for #VC and #Matching on 3-Regular Graphs. STACS 2024: 49:1-49:18 - Maximilien Dreveton, Alperen Gözeten, Matthias Grossglauser, Patrick Thiran:
Universal Lower Bounds and Optimal Rates: Achieving Minimax Clustering Error in Sub-Exponential Mixture Models. CoRR abs/2402.15432 (2024) - Prafullkumar Tale:
Double Exponential Lower Bound for Telephone Broadcast. CoRR abs/2403.03501 (2024) - 2023
- Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev:
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds. J. ACM 70(4): 25:1-25:62 (2023) - Yann Disser, Oliver Friedmann, Alexander V. Hopp:
An exponential lower bound for Zadeh's pivot rule. Math. Program. 199(1): 865-936 (2023) - Kei Uchizawa, Haruki Abe:
Exponential Lower Bounds for Threshold Circuits of Sub-Linear Depth and Energy. MFCS 2023: 85:1-85:15 - Ioannis Panageas, Nikolas Patris, Stratis Skoulakis, Volkan Cevher:
Exponential Lower Bounds for Fictitious Play in Potential Games. NeurIPS 2023 - Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio:
Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas. CoRR abs/2309.12513 (2023) - Ioannis Panageas, Nikolas Patris, Stratis Skoulakis, Volkan Cevher:
Exponential Lower Bounds for Fictitious Play in Potential Games. CoRR abs/2310.02387 (2023) - Pravesh K. Kothari, Peter Manohar:
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes. CoRR abs/2311.00558 (2023) - Prerona Chatterjee, Deepanshu Kush, Shubhangi Saraf, Amir Shpilka:
Exponential Lower Bounds Against Sums of ROABPs. Electron. Colloquium Comput. Complex. TR23 (2023) - Pravesh Kothari, Peter Manohar:
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- Benjamin E. Diamond, Amir Yehudayoff:
Explicit exponential lower bounds for exact hyperplane covers. Discret. Math. 345(11): 113114 (2022) - Pravesh K. Kothari, Raghu Meka, Prasad Raghavendra:
Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs. SIAM J. Comput. 51(2): 17-305 (2022) - Ye Yuan, Wei Yi, Pramod K. Varshney:
Exponential Mixture Density Based Approximation to Posterior Cramr-Rao Lower Bound for Distributed Target Tracking. IEEE Trans. Signal Process. 70: 862-877 (2022) - Aaron Potechin, Goutham Rajendran:
Sub-exponential time Sum-of-Squares lower bounds for Principal Components Analysis. NeurIPS 2022 - 2021
- Dömötör Pálvölgyi:
Exponential Lower Bound for Berge-Ramsey Problems. Graphs Comb. 37(4): 1433-1435 (2021) - Pengfei Yao:
Lower Bounds of Optimal Exponentials of Thickness in Geometry Rigidity Inequality for Shells. J. Syst. Sci. Complex. 34(6): 2092-2108 (2021) - Omar Alrabiah, Venkatesan Guruswami:
An Exponential Lower Bound on the Sub-Packetization of Minimum Storage Regenerating Codes. IEEE Trans. Inf. Theory 67(12): 8086-8093 (2021) - Gellért Weisz, Philip Amortila, Csaba Szepesvári:
Exponential Lower Bounds for Planning in MDPs With Linearly-Realizable Optimal Action-Value Functions. ALT 2021: 1237-1264 - Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu:
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. FOCS 2021: 739-750 - Andrea Zanette:
Exponential Lower Bounds for Batch Reinforcement Learning: Batch RL can be Exponentially Harder than Online RL. ICML 2021: 12287-12297 - 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) - Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu:
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. CoRR abs/2111.01060 (2021) - Benjamin E. Diamond, Amir Yehudayoff:
Explicit Exponential Lower Bounds for Exact Hyperplane Covers. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- Jared Bitz, Sarah Griffith, Xiaoyu He:
Exponential lower bounds on the generalized Erdős-Ginzburg-Ziv constant. Discret. Math. 343(12): 112083 (2020) - Marcin Pilipczuk, Manuel Sorge:
A Double Exponential Lower Bound for the Distinct Vectors Problem. Discret. Math. Theor. Comput. Sci. 22(4) (2020)
skipping 171 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-25 19:11 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