Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

23 relations
Analysis of algorithmsAverage-case complexityBest, worst and average caseComputationally bounded adversary

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
Computational Feasibility of Clustering under Clusterability Assumptions
It is well known that most of the common clustering objectives are NP-hard to optimize. In practice, however, clustering is being… 
2011
2011
Dynamics On and Of Complex Networks V
Vélo’v 
2008
2008
Interference Avoidance and Control
The throughput of a wireless network is often limited by interference caused by multiple concurrently active nodes . The… 
2007
2007
Sforzesco brace (SPoRT Concept) versus Risser cast in adolescent idiopathic scoliosis treatment: similar efficacy, with reduced spinal side effects for the brace
Study design From our prospective database we included all patients with AIS, followed-up for eighteen months during Risser cast… 
2002
2002
Zone recovery methodology for probe-subset selection in end-to-end network monitoring
To predict the delay between a source and a destination as well as to identify anomalies in a network, it is possible to monitor… 
2002
2002
Automation of a Navier-Stokes S&C database generation for the Harrier in ground effect
A method of automating the generation of a time-dependent, Navier-Stokes, static stability and control (S&C) database for the… 
1995
1995
Materialized object-oriented views in MultiView
Object-oriented view mechanisms have received much attention in the literature in recent years, since they provide powerful… 
1992
1992
On the performance bounds for a class of rectilinear Steiner tree heuristics in arbitrary dimension
  • A. KahngG. Robins
  • IEEE Trans. Comput. Aided Des. Integr. Circuits…
  • 1992
  • Corpus ID: 17131481
A family of examples on which a large class C of minimum spanning tree-based rectilinear Steiner tree heuristics has a… 
1992
1992
GMSK with Frequency-Selective Rayleigh Fading and Cochannel Interference
  • I. Korn
  • IEEE J. Sel. Areas Commun.
  • 1992
  • Corpus ID: 41110521
The author derives a formula for error probability of partial-response continuous-phase modulation with differential phase… 
1991
1991
Bidirectional Parsing of Lexicalized Tree Adjoining Grammars
In this paper a bidirectional parser for Lexicalized Tree Adjoining Grammars will be presented. The algorithm takes advantage of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)