The following pages link to Pekka Orponen (Q395020):
Displaying 41 items.
- Search methods for tile sets in patterned DNA self-assembly (Q395021) (← links)
- Optimization, block designs and no free lunch theorems (Q1041724) (← links)
- A classification of complexity core lattices (Q1099613) (← links)
- Computing with truly asynchronous threshold logic networks (Q1269908) (← links)
- Exponential transients in continuous-time Liapunov systems. (Q1426460) (← links)
- Algorithmic design of cotranscriptionally folding 2D RNA origami structures (Q1799372) (← links)
- Random strings make hard instances (Q1816733) (← links)
- Unconventional computation and natural computation. 19th international conference, UCNC 2021, Espoo, Finland, October 18--22, 2021. Proceedings (Q2245938) (← links)
- Online bin packing with delay and holding costs (Q2376721) (← links)
- Exact and approximate balanced data gathering in energy-constrained sensor networks (Q2575091) (← links)
- Dempster's rule of combination is {\#}P-complete (Q2638783) (← links)
- Probably approximately optimal satisficing strategies (Q2674195) (← links)
- Unordered Constraint Satisfaction Games (Q2912709) (← links)
- Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly (Q3070963) (← links)
- Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly (Q3092339) (← links)
- (Q3219763) (← links)
- (Q3350759) (← links)
- Continuous-Time Symmetric Hopfield Nets Are Computationally Universal (Q3375307) (← links)
- An efficient local search method for random 3-satisfiability (Q3439117) (← links)
- (Q3497967) (← links)
- (Q3670562) (← links)
- (Q3690221) (← links)
- (Q3747724) (← links)
- The density and complexity of polynomial cores for intractable sets (Q3751007) (← links)
- Optimal Approximations and Polynomially Levelable Sets (Q3787474) (← links)
- OnP-subset structures (Q3789542) (← links)
- Lowness Properties of Sets in the Exponential-Time Hierarchy (Q3798242) (← links)
- (Q4028800) (← links)
- Instance complexity (Q4299297) (← links)
- (Q4336274) (← links)
- (Q4496256) (← links)
- On the computational power of discrete Hopfield nets (Q4630262) (← links)
- (Q4727431) (← links)
- (Q4787393) (← links)
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results (Q4819851) (← links)
- Neural networks and complexity theory (Q5096819) (← links)
- Computing with continuous-time Liapunov systems (Q5176031) (← links)
- Algorithmic Aspects of Wireless Sensor Networks (Q5312967) (← links)
- Experimental and Efficient Algorithms (Q5710052) (← links)
- Theory and Applications of Satisfiability Testing (Q5713746) (← links)
- Design methods for 3D wireframe DNA nanostructures (Q6084211) (← links)
