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
2011
Review
2011
Modeling and Distributed Provisioning in 10–40–100-Gb/s Multirate Wavelength Switched Optical Networks
In wavelength-switched optical networks (WSONs), quality of transmission (QoT) has to be guaranteed during lightpath provisioning… 
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… 
2004
2004
A branch & bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
2002
2002
Efficient hedging in incomplete markets under model uncertainty
We consider an investor who has sold a contingent claim and intends to minimize the maximal expected weighted shortfall. Here… 
1998
1998
Implementing Real-time Video Decoding On Multimedia Processors By Complexity Prediction Techniques
The implementation of software based video/audio decoders is an advantageous solution over traditional dedicated hardware systems… 
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… 
Highly Cited
1995
Highly Cited
1995
OODB indexing by class-division
Indexing a class hierarchy, in order to efficiently search or update the objects of a class according to a (range of) value(s) of… 
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)