Computable real function F such that F is not polynomial time computable on [0, 1].

Sergey V. Yakhontov

Published in: CoRR (2014)

Keyphrases

turing machine
finite sets
piecewise linear
approximation algorithms
relational databases
special case
database
data sets
learning algorithm
case study
search algorithm
computational complexity
expert systems
real life
np hardness