Nonlinear Theory and Its Applications, IEICE
Online ISSN : 2185-4106
ISSN-L : 2185-4106
Special Section on Nonlinear Science Workshop on the Journal
Relationship between the number of elements in constraint satisfaction problems and the computation time of HNN
Takumi GENKAKenya JIN'NO
著者情報
ジャーナル フリー

2022 年 13 巻 2 号 p. 282-287

詳細
抄録

In this paper, we aim to clarify the computational complexity of artificial neural networks. We investigate the computational complexity of hysteresis neural networks (HNN) for solving constraint satisfaction problems. We confirm that the amount of computation is proportional to the logarithm of the size of the problem.

著者関連情報
© 2022 The Institute of Electronics, Information and Communication Engineers
前の記事 次の記事
feedback
Top