| |||
модель квантовой бинарной оптимизации без ограничений для решения задачи разделения графа (The goals are to divide the graph into two subsets, known as partitions, which we want to have equal size, and to minimize the number of links between the partitions. This problem is known as graph partitioning, and the general problem is NP-hard.  dwavesys.com Alex_Odeychuk) | |||
