Worst-case complexity

Known as: Worst case complexity 
In computer science, the worst-case complexity (usually denoted in asymptotic notation) measures the resources (e.g. running time, memory) an… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We describe a new blackbox complexity testing technique for determining the worst-case asymptotic complexity of a given… (More)
  • figure 1
  • figure 4
  • figure 3
  • figure 6
  • figure 7
Is this relevant?
2013
2013
In this paper we prove that direct search of directional type shares the worst case complexity bound of steepest descent when… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
An Adaptive Regularisation framework using Cubics (ARC) was proposed for unconstrained optimization and analysed in Cartis, Gould… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Program analysis and automated test generation have primarily been used to find correctness bugs. We present complexity testing… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Lattice reduction by means of the LLL algorithm has been previously suggested as a powerful preprocessing tool that allows to… (More)
  • table 1
Is this relevant?
2006
2006
The k-means method is an old but popular clustering algorithm known for its speed and simplicity. Until recently, however, no… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Sphere decoding has been suggested by a number of authors as an efficient algorithm to solve various detection problems in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The problem of finding the least-squares solution to a system of linear equations where the unknown vector is comprised of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1997
1997
Gaussian elimination is the baais for classical algorithms for computing canonical forms of integer matrices. Experimental… (More)
  • figure 1
Is this relevant?
Highly Cited
1978
Highly Cited
1978
In this paper we investigate the worst-case complexity of range searching: preprocess N points in k-space such that range queries… (More)
  • figure 3.1
  • figure 3.2
  • figure 3.4
  • figure 3.5
  • figure 5.1
Is this relevant?