asymptotic computational complexity
Sign in to saveAlso known as asymptotic complexity
computational complexity as measured by the limiting behavior of resource usage for large inputs
In the Vinony graph
Vinony's link graph records 34 inbound references to asymptotic computational complexity, and connects out to big O notation, upper and lower bounds and algorithm.
It is catalogued under the topic Computational complexity theory.
Vinony links it to 4 Wikipedia language editions.
Wikidata facts
Show 4 more facts
- facet of
- asymptotic analysis
- studied by
- computational complexity theory
- different from
- big O notation
- notation
- big O notation
Sources (2)
via Wikidata · CC0
Connections
big O notation
Entity
upper and lower bounds
Entity
algorithm
Entity
digital object identifier
Entity
parallel computing
Entity
theoretical computer science
Entity
computational complexity theory
Entity
Juris Hartmanis
Entity
NP-complete
Entity
time complexity
Entity
Richard E. Stearns
Entity
analysis of algorithms
Entity
randomized algorithm
Entity
model of computation
Entity
deterministic algorithm
Entity
computational complexity
Entity
asymptotic analysis
Entity
David S. Johnson
Entity
computational problem
Entity
nondeterministic algorithm
Entity