Sciweavers

13603 search results - page 57 / 2721
» On the Complexity of Computing Treelength
Sort
View
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
14 years 2 months ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
BIRTHDAY
2003
Springer
14 years 2 months ago
On the Computational Complexity of Bisimulation, Redux
Faron Moller, Scott A. Smolka
CIE
2006
Springer
14 years 26 days ago
Prefix-Like Complexities and Computability in the Limit
Alexey V. Chernov, Jürgen Schmidhuber