Search filters

List of works by Pekka Orponen

Attraction Radii in Binary Hopfield Nets are Hard to Compute

article

Circumspect descent prevails in solving random constraint satisfaction problems.

scholarly article

Continuous-time symmetric Hopfield nets are computationally universal

scientific article published in March 2003

DNA rendering of polyhedral meshes at the nanoscale.

scientific article published on July 2015

Exact and approximate balanced data gathering in energy-constrained sensor networks

article by Patrik Bertel Johan Floreen et al published November 2005 in Theoretical Computer Science

General-purpose computation with neural networks: a survey of complexity theoretic results.

scientific article published on December 2003

On the computational complexity of binary and analog symmetric hopfield nets

scientific article published in December 2000

Witness of unsatisfiability for a random 3-satisfiability formula

scientific article published on 20 May 2013

Paulina is supported by:

About Paulina

Help