Pekka Orponen
TitleCited byYear
DNA rendering of polyhedral meshes at the nanoscale
E Benson, A Mohammed, J Gardell, S Masich, E Czeizler, P Orponen, ...
Nature 523 (7561), 441, 2015
General-purpose computation with neural networks: A survey of complexity theoretic results
J Šíma, P Orponen
Neural Computation 15 (12), 2727-2778, 2003
On approximation preserving reductions: complete problems and robust measures
P Orponen, H Mannila
On the effect of analog noise in discrete-time analog computations
W Maass, P Orponen
Neural Computation 10 (5), 1071-1095, 1998
Dempster's rule of combination is# P-complete
P Orponen
Artificial Intelligence 44 (1-2), 245-253, 1990
Computational complexity of neural networks
P Orponen
Nordic Journal of Computing, 1994
Lifetime maximization for multicasting in energy-constrained wireless networks
P Floréen, P Kaski, J Kohonen, P Orponen
IEEE Journal on Selected Areas in Communications 23 (1), 117-126, 2005
Instance complexity
KI Ko, P Orponen, U Schöning, O Watanabe
Universität Ulm, 2012
Focused local search for random 3-satisfiability
S Seitz, M Alava, P Orponen
Journal of Statistical Mechanics: Theory and Experiment 2005 (06), P06006, 2005
A Survey of Continous-Time Computation Theory
P Orponen
Advances in algorithms, languages, and complexity, 209-224, 1997
The density and complexity of polynomial cores for intractable sets
P Orponen, U Schöning
Information and Control 70 (1), 54-68, 1986
Exact and approximate balanced data gathering in energy-constrained sensor networks
P Floréen, P Kaski, J Kohonen, P Orponen
Theoretical computer science 344 (1), 30-46, 2005
The computational power of discrete Hopfield nets with hidden units
P Orponen
Neural Computation 8 (2), 403-415, 1996
Continuous-time symmetric Hopfield nets are computationally universal
J Šíma, P Orponen
Neural Computation 15 (3), 693-733, 2003
On the computational complexity of analyzing Hopfield nets
P Floreen, P Orponen
Complex Systems, 1989
Optimal approximations and polynomially levelable sets
P Orponen, DA Russo, U Schöning
SIAM Journal on Computing 15 (2), 399-408, 1986
Locally computable approximations for spectral clustering and absorption times of random walks
P Orponen, SE Schaeffer, VÁ Gaytán
arXiv preprint arXiv:0810.4061, 2008
Circumspect descent prevails in solving random constraint satisfaction problems
M Alava, J Ardelius, E Aurell, P Kaski, S Krishnamurthy, P Orponen, ...
Proceedings of the National Academy of Sciences 105 (40), 15253-15257, 2008
Computing with truly asynchronous threshold logic networks
P Orponen
Theoretical Computer Science 174 (1-2), 123-136, 1997
Probably approximately optimal satisficing strategies
R Greiner, P Orponen
Artificial Intelligence 82 (1-2), 21-44, 1996
The system can't perform the operation now. Try again later.
Articles 1–20