Login / Signup
A Necessary and Sufficient Condition for Embedding Principally Decomposable Finite Lattices into the Computably Enumerable Degrees.
Manuel Lerman
Published in:
Ann. Pure Appl. Log. (2000)
Keyphrases
</>
sufficient conditions
vector space
asymptotic stability
linear systems
inductive inference
exponential stability
neural network
lyapunov function
efficiently computable
markov networks
linear complementarity problem
uniform convergence
equilibrium point