On the computational complexity of analyzing Hopfield nets

Visa fullständig post



Permalänk

http://hdl.handle.net/10138/243070

Citation

Floreen , P & Orponen , P 1989 , ' On the computational complexity of analyzing Hopfield nets ' , Complex Systems , vol. 1989 , no. 3 , pp. 577-587 .

Titel: On the computational complexity of analyzing Hopfield nets
Författare: Floreen, Patrik; Orponen, Pekka
Medarbetare: University of Helsinki, Department of Computer Science
University of Helsinki, Department of Computer Science
Datum: 1989
Språk: eng
Sidantal: 10
Tillhör serie: Complex Systems
ISSN: 0891-2513
Permanenta länken (URI): http://hdl.handle.net/10138/243070
Subject: 113 Computer and information sciences
Licens:


Filer under denna titel

Totalt antal nerladdningar: Laddar...

Filer Storlek Format Granska
1989_On_the_computational_hopanal.pdf 175.6Kb PDF Granska/Öppna

Detta dokument registreras i samling:

Visa fullständig post