Blum complexity measures
E117702
UNEXPLORED
Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
Referenced by (1)
| Subject (surface form when different) | Predicate |
|---|---|
|
Manuel Blum
→
|
notableWork |