about
General-purpose computation with neural networks: a survey of complexity theoretic results.Circumspect descent prevails in solving random constraint satisfaction problems.DNA rendering of polyhedral meshes at the nanoscale.Witness of unsatisfiability for a random 3-satisfiability formula.Continuous-time symmetric Hopfield nets are computationally universal.On the computational complexity of binary and analog symmetric hopfield netsExact and approximate balanced data gathering in energy-constrained sensor networksAttraction Radii in Binary Hopfield Nets are Hard to Compute
P50
Q35589642-F98FFFA7-8F9B-41B6-ADD8-4B0989A9360DQ36926906-9F8B0B9B-793A-43D5-9F77-4075A6D9872DQ40298947-A42F0671-79F4-43B0-B23F-CF6405638FF6Q44634140-E31C5EC2-E04D-4114-AF73-3A0359363281Q51639700-AD80C0F6-A644-40AB-8CAA-6A7EFC4D3BA5Q51644003-4760280A-F1D9-42A0-9ED6-E9A00282BE86Q57540253-20B916DC-A447-44E0-9C6D-7C459231C2B1Q57540266-3CEDE58E-0961-4A3F-B1C7-A49069520966
P50
description
hulumtues
@sq
researcher
@en
wetenschapper
@nl
հետազոտող
@hy
name
Pekka Orponen
@ast
Pekka Orponen
@en
Pekka Orponen
@es
Pekka Orponen
@nl
Pekka Orponen
@sl
type
label
Pekka Orponen
@ast
Pekka Orponen
@en
Pekka Orponen
@es
Pekka Orponen
@nl
Pekka Orponen
@sl
prefLabel
Pekka Orponen
@ast
Pekka Orponen
@en
Pekka Orponen
@es
Pekka Orponen
@nl
Pekka Orponen
@sl
P1053
E-7332-2012
P106
P108
P21
P2456
o/PekkaOrponen
P31
P3829
P496
0000-0002-0417-2104