|
Diskretnyi Analiz i Issledovanie Operatsii, Ser. 2, 2005, Volume 12, Issue 1, Pages 3–11
(Mi da83)
|
|
|
|
An efficient algorithm for solving the problem of minimizing polynomials in Boolean variables with the connectedness property
V. L. Beresnev Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Received: 05.04.2005
Citation:
V. L. Beresnev, “An efficient algorithm for solving the problem of minimizing polynomials in Boolean variables with the connectedness property”, Diskretn. Anal. Issled. Oper., Ser. 2, 12:1 (2005), 3–11
Linking options:
https://www.mathnet.ru/eng/da83 https://www.mathnet.ru/eng/da/v12/s2/i1/p3
|
Statistics & downloads: |
Abstract page: | 388 | Full-text PDF : | 121 | References: | 52 |
|