Login / Signup
An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n+1) - p(n) ≤ 2.
Julien Leroy
Published in:
Discret. Math. Theor. Comput. Sci. (2014)
Keyphrases
</>
decision problems
support vector
information technology
high computational complexity
complexity measures
neural network
real world
data mining
information retrieval
learning algorithm
information systems
case study
computational complexity
artificial neural networks
np hard
computational cost