Arithmetical definability and computational complexity.
Yassine HachaïchiPublished in: Theor. Comput. Sci. (2004)
Keyphrases
- computational complexity
- np complete
- special case
- computational efficiency
- fixed point
- propositional logic
- databases
- computational load
- np hard
- computationally efficient
- rate distortion
- decision problems
- linear computational complexity
- storage requirements
- memory requirements
- bit rate
- computational cost
- database systems
- search engine
- information retrieval