Výsledky vyhledávání - theory of a finite number of associative and computation functions
-
1
Growth Rates of the Number of Indecomposable Summands in Tensor Powers
ISSN: 1386-923X, 1572-9079Vydáno: Dordrecht Springer Netherlands 01.04.2024Vydáno v Algebras and representation theory (01.04.2024)“…In this paper we study the asymptotic behavior of the number of summands in tensor products of finite dimensional representations of affine (semi)group (super…”
Získat plný text
Journal Article -
2
Associative memory in a network of 'spiking' neurons
ISSN: 0954-898X, 1361-6536Vydáno: Colchester Informa UK Ltd 1992Vydáno v Network (Bristol) (1992)“…The Hopfield network provides a simple model of an associative memory in a neuronal structure…”
Získat plný text
Journal Article -
3
Complexity classes defined via k-valued functions
ISBN: 0818656700, 9780818656705, 9780818656729, 0818656727ISSN: 1063-6870Vydáno: IEEE Comput. Soc. Press 1994Vydáno v Proceedings - Structure in Complexity Theory Conference (1994)“…A lot of complexity classes can be characterized by posing some global acceptance condition on the computation trees produced by nondeterministic polynomial time machines…”
Získat plný text
Konferenční příspěvek Journal Article

