# Worst-case complexity

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

- ESEC/SIGSOFT FSE
- 2018

We describe a new blackbox complexity testing technique for determining the worst-case asymptotic complexity of a givenâ€¦Â (More)

Is this relevant?

2013

2013

- EURO J. Computational Optimization
- 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

- Math. Program.
- 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

- IEEE 31st International Conference on Softwareâ€¦
- 2009

Program analysis and automated test generation have primarily been used to find correctness bugs. We present complexity testingâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- IEEE International Conference on Acousticsâ€¦
- 2008

Lattice reduction by means of the LLL algorithm has been previously suggested as a powerful preprocessing tool that allows toâ€¦Â (More)

Is this relevant?

2006

2006

- 2006

The k-means method is an old but popular clustering algorithm known for its speed and simplicity. Until recently, however, noâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- IEEE Transactions on Signal Processing
- 2005

Sphere decoding has been suggested by a number of authors as an efficient algorithm to solve various detection problems inâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- IEEE Transactions on Signal Processing
- 2005

The problem of finding the least-squares solution to a system of linear equations where the unknown vector is comprised ofâ€¦Â (More)

Is this relevant?

1997

1997

- ISSAC
- 1997

Gaussian elimination is the baais for classical algorithms for computing canonical forms of integer matrices. Experimentalâ€¦Â (More)

Is this relevant?

Highly Cited

1978

Highly Cited

1978

- Acta Informatica
- 1978

In this paper we investigate the worst-case complexity of range searching: preprocess N points in k-space such that range queriesâ€¦Â (More)

Is this relevant?