On Total Functions, Existence Theorems and Computational Complexity.
Nimrod MegiddoChristos H. PapadimitriouPublished in: Theor. Comput. Sci. (1991)
Keyphrases
- computational complexity
- np complete
- real world
- fixed point theorem
- memory requirements
- low complexity
- computationally efficient
- search algorithm
- special case
- computational cost
- sufficient conditions
- knowledge base
- decision problems
- computer vision
- machine learning
- high computational complexity
- digital topology
- real time