Login / Signup
Comparing Universal Covers in Polynomial Time.
Jirí Fiala
Daniël Paulusma
Published in:
Theory Comput. Syst. (2010)
Keyphrases
</>
turing machine
computational complexity
special case
worst case
approximation algorithms
neural network
genetic algorithm
video sequences
book covers
optimal planning
kolmogorov complexity