tijdcomplexiteit
Sign in to saveestimate of time taken for running an algorithm
In the Vinony graph
Within Vinony's link graph, tijdcomplexiteit is referenced by 1,191 other articles, and connects out to P versus NP problem, big O notation and binary search algorithm.
Vinony files it under Analysis of algorithms, Computational complexity theory and Computational resources.
Its subject is documented across 30 Wikipedia language editions.
Wikidata facts
- Subclass of
- computational complexity
Show 2 more facts
- facet of
- algorithm
- different from
- space complexity
Sources (2)
via Wikidata · CC0
Connections
P versus NP problem
Entity
big O notation
Entity
binary search algorithm
Entity
merge sort
Entity
travelling salesperson problem
Entity
approximation algorithm
Entity
EXPTIME
Entity
chess
Entity
statistics
Entity
International Standard Book Number
Entity
algorithm
Entity
go
Entity
function
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
bit
Entity
checkers
Entity
game theory
Entity
machine learning
Entity
polynomial
Entity