Остановите войну!
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 132 matches
- 2024
- Frank E. Curtis, Michael O'Neill, Daniel P. Robinson:
Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization. Math. Program. 205(1): 431-483 (2024) - Geovani Nunes Grapiglia:
Worst-case evaluation complexity of a derivative-free quadratic regularization method. Optim. Lett. 18(1): 195-213 (2024) - Tom van Dijk, Georg Loho, Matthew T. Maat:
The Worst-Case Complexity of Symmetric Strategy Improvement. CSL 2024: 24:1-24:19 - Kaja Gruntkowska, Alexander Tyurin, Peter Richtárik:
Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity. CoRR abs/2402.06412 (2024) - 2023
- Marc Teboulle, Yakov Vaisbourd:
An elementary approach to tight worst case complexity analysis of gradient based methods. Math. Program. 201(1): 63-96 (2023) - Geovani Nunes Grapiglia:
Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization. Optim. Methods Softw. 38(4): 781-803 (2023) - Olivier Ploton, Vincent T'kindt:
Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion-Exclusion. J. Sched. 26(2): 137-145 (2023) - Frank E. Curtis, Qi Wang:
Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization. SIAM J. Optim. 33(3): 2191-2221 (2023) - Tom van Dijk, Georg Loho, Matthew T. Maat:
The Worst-Case Complexity of Symmetric Strategy Improvement. CoRR abs/2309.02223 (2023) - Yanyi Liu, Rafael Pass:
On One-way Functions and the Worst-case Hardness of Time-Bounded Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR23 (2023) - Yanyi Liu, Rafael Pass:
On One-way Functions and the Worst-case Hardness of Time-Bounded Kolmogorov Complexity. IACR Cryptol. ePrint Arch. 2023: 1086 (2023) - 2022
- Jingzhao Zhang, Hongzhou Lin, Subhro Das, Suvrit Sra, Ali Jadbabaie:
Beyond Worst-Case Analysis in Stochastic Approximation: Moment Estimation Improves Instance Complexity. ICML 2022: 26347-26361 - Lirong Xia, Weiqiang Zheng:
Beyond the Worst Case: Semi-random Complexity Analysis of Winner Determination. WINE 2022: 330-347 - Andrew Lewis-Pye:
Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model. CoRR abs/2201.01107 (2022) - Wenjie Xu, Yuning Jiang, Emilio Tanowe Maddalena, Colin N. Jones:
Lower Bounds on the Worst-Case Complexity of Efficient Global Optimization. CoRR abs/2209.09655 (2022) - Lirong Xia, Weiqiang Zheng:
Beyond the Worst Case: Semi-Random Complexity Analysis of Winner Determination. CoRR abs/2210.08173 (2022) - 2021
- Geovani Nunes Grapiglia, Flávia Chorobura:
Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations. Comput. Appl. Math. 40(8) (2021) - Hezhi Luo, Xiaodong Ding, Jiming Peng, Rujun Jiang, Duan Li:
Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties. INFORMS J. Comput. 33(1): 180-197 (2021) - Ana Luísa Custódio, Youssef Diouane, Rohollah Garmanjani, Elisa Riccietti:
Worst-Case Complexity Bounds of Directional Direct-Search Methods for Multiobjective Optimization. J. Optim. Theory Appl. 188(1): 73-93 (2021) - Serge Gratton, Ehouarn Simon, Philippe L. Toint:
An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity. Math. Program. 187(1): 1-24 (2021) - Ruoyu Sun, Yinyu Ye:
Worst-case complexity of cyclic coordinate descent: O(n2) gap with randomized version. Math. Program. 185(1-2): 487-520 (2021) - Geovani Nunes Grapiglia, Ekkehard W. Sachs:
A generalized worst-case complexity analysis for non-monotone line searches. Numer. Algorithms 87(2): 779-796 (2021) - 2020
- Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints. SIAM J. Optim. 30(1): 513-541 (2020) - Shuichi Hirahara:
Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity. FOCS 2020: 50-60 - Oded Goldreich, Guy N. Rothblum:
Worst-Case to Average-Case Reductions for Subclasses of P. Computational Complexity and Property Testing 2020: 249-295 - Shuichi Hirahara:
Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity. Electron. Colloquium Comput. Complex. TR20 (2020) - 2019
- Valentin Touzeau:
Static analysis of least recently used caches: complexity, optimal analysis, and applications to worst-case execution time and security. (Analyse statique de caches LRU : complexité, analyse optimale, et applications au calcul de pire temps d'exécution et à la sécurité). Grenoble Alpes University, France, 2019 - Peijun Xiao, Zhisheng Xiao, Ruoyu Sun:
Understanding Limitation of Two Symmetrized Orders by Worst-case Complexity. CoRR abs/1910.04366 (2019) - 2018
- Boleslaw Z. Kacewicz:
Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information. J. Complex. 47: 86-96 (2018) - Immanuel M. Bomze, Werner Schachinger, Reinhard Ullrich:
The Complexity of Simple Models - A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem. Math. Oper. Res. 43(2): 651-674 (2018)
skipping 102 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 15:31 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