Fig. 7: Computational hardness of CNP problems. | Communications Physics

Fig. 7: Computational hardness of CNP problems.

From: Efficient computation using spatial-photonic Ising machines with low-rank and circulant matrix constraints

Fig. 7

a The number of configurations the modified complete differencing algorithm must search to determine if a perfect solution exists in a CNP problem instance as a function of size N and bias S. b Degeneracy of the ground state as a function of size N for CNP problems with different bias ratio parameters b. Integers of the CNP instances were drawn uniformly at random from the range [1, 212].

Back to article page