Relationship between the number of elements in constraint satisfaction problems and the computation time of HNN

Takumi GENKA; Kenya JIN'NO

doi:10.1587/nolta.13.282

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

著者情報

キーワード: neural networks, constraint satisfaction problem, computation time, computation complexity, ordinary differential equation

ジャーナルフリー

2022 年 13 巻 2 号 p. 282-287

DOI https://doi.org/10.1587/nolta.13.282

詳細

抄録

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.

責任著者(Corresponding author)

J-STAGEへの登録はこちら（無料）