Login / Signup
Diagonalizations over Polynomial Time Computable Sets.
Klaus Ambos-Spies
Hans Fleischhack
Hagen Huwig
Published in:
Theor. Comput. Sci. (1987)
Keyphrases
</>
finite sets
turing machine
data sets
special case
neural network
scheduling problem
artificial intelligence
social networks
computer vision
website
multi agent systems
np hard
worst case
piecewise linear