Author:
Šíma Jiří,Orponen Pekka,AnttiPoika Teemu
Publisher
Springer Berlin Heidelberg
Reference34 articles.
1. Aarts, E., Korst, J. Simulated Annealing and Boltzmann Machines. Wiley and Sons, 1989.
2. Balcá J.L., Gavaldàgelmann, H. T. Computational power of neural networks: A characterization in terms of Kolmogorov complexity. IEEE Transactions of Information Theory, 43, 1175–1183, 1997.
3. Barahona, F. On the computational complexity of Ising spin glass models. Journal of Physics A, 15, 3241–3253, 1982.
4. Bertoni, A., Compadelli, P. On the approximability of the energy function. In Proceedings of the ICANN’rence, 1157–1160, Springer-Verlag, 1994.
5. Bertoni, A., Campadelli, P., Gangai, C., Posenato, R. Approximability of the ground state problem for certain Ising spin glasses. Journal of Complexity, 13, 323–339, 1997.