Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
worst-case complexity
Description:
A measure of an algorithm’s resource use, such as time or space, under the most demanding inputs of a given size.
Related topics:
Complexity and Algorithms in Graphs (17%),
Advanced Optimization Algorithms Research (11%),
Algorithms and Data Compression (8%)
Wikidata ID:
wiki/Q8037118
OpenAlex ID:
keywords/worst-case-complexity
Computational geometry. an introduction
1985
·
Franco P. Preparata
, Michael Ian Shamos
·
3,259
A fast string searching algorithm
1977
·
Robert S. Boyer
, J. Strother Moore
·
Communications of the ACM
·
2,565
An Introduction to Optimization on Smooth Manifolds
2023
·
Nicolas Boumal
·
Cambridge University Press eBooks
·
1,388
PDF
Cubic regularization of Newton method and its global performance
2006
·
Yurii Nesterov
, B.T. Polyak
·
Mathematical Programming
·
1,221
Modern hierarchical, agglomerative clustering algorithms
2011
·
Müllner, Daniel
·
arXiv (Cornell University)
·
1,197
PDF
How Good Is the Simplex Algorithm
1970
·
Victor Klee
, George J. Minty
·
1,076
Randomized Algorithms for Matrices and Data
2011
·
Michael W. Mahoney
·
Foundations and Trends® in Machine Learning
·
861
The auction algorithm: A distributed relaxation method for the assignment problem
1988
·
D. P. Bertsekas
·
Annals of Operations Research
·
731
PDF
Determinant Maximization with Linear Matrix Inequality Constraints
1998
·
Lieven Vandenberghe
, Stephen Boyd
, et al.
·
SIAM Journal on Matrix Analysis and Applications
·
713
Comparing performance of algorithms for generating concept lattices
2002
·
Sergei O. Kuznetsov
, Sergei A. Obiedkov
·
Journal of Experimental & Theoretical Artificial Intelligence
·
576
Randomized Algorithms for Matrices and Data
2012
·
MICHAEL MAHONEY
·
Chapman & Hall/CRC data mining and knowledge discovery series
·
551
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
1976
·
Ellis Horowitz
, Sartaj Sahni
·
Journal of the ACM
·
544
PDF
Predicting Lattice Reduction
2008
·
Nicolas Gama
, Phong Q. Nguyen
·
Springer eBooks
·
499
Linear Information
2008
·
Erich Novak
, Henryk Woźniakowski
·
EMS tracts in mathematics
·
491
Finding a Minimum Circuit in a Graph
1978
·
Alon Itai
, Michael Rodeh
·
SIAM Journal on Computing
·
487
Interior point methods 25 years later
2011
·
Jacek Gondzio
·
European Journal of Operational Research
·
480
PDF
Dual extrapolation and its applications to solving variational inequalities and related problems
2006
·
Yurii Nesterov
·
Mathematical Programming
·
450
Lower bounds for finding stationary points I
2019
·
Yair Carmon
, John C. Duchi
, et al.
·
Mathematical Programming
·
433
PDF
On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
1993
·
Shinji Mizuno
, Michael J. Todd
, et al.
·
Mathematics of Operations Research
·
432
Finding the convex hull of a simple polygon
1983
·
Ronald L Graham
, F Frances Yao
·
Journal of Algorithms
·
424
Backdoors to typical case complexity
2003
·
Ryan Williams
, Carla P. Gomes
, et al.
·
International Joint Conference on Artificial Intelligence
·
419
Explicit Cost Bounds of Algorithms for Multivariate Tensor Product Problems
1995
·
G.W. Wasilkowski
, H. Wozniakowski
·
Journal of Complexity
·
401
On a class of O(n2) problems in computational geometry
1995
·
Anka Gajentaan
, Mark H Overmars
·
Computational Geometry
·
380
PDF
Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity
2010
·
Coralia Cartis
, Nicholas I. M. Gould
, et al.
·
Mathematical Programming
·
375
Boolean and Cartesian Abstraction for Model Checking C Programs
2001
·
Thomas Ball
, Andreas Podelski
, et al.
·
Lecture notes in computer science
·
362
PDF
Show more works
View as search
Works count:
1,830
Citation count:
44,030
Year
Topic
Type