|
|
|
|
|
Aleksey I. Pakhomchik, Vladimir V. Voloshinov, Valerii M. Vinokur and Gordey B. Lesovik
There exists a wide range of constraint programming (CP) problems defined on Boolean functions depending on binary variables. One of the approaches to solving CP problems is using specific appropriate solvers, e.g., SAT solvers. An alternative is using t...
ver más
|
|
|
|
|
|
|
|
|
|
|
R. Y. Vinokur
Pág. 359 - 369
|
|
|
|
|
|
|
|
|
|
|
Vinokur, Roman
Pág. 19 - 23
|
|
|
|
|
|
|
|
|
|
|
|
|
Rodov, V. Horev, B. Vinokur, Y. Copel, A. Aharoni, Y. Aharoni, N.
Pág. 950 - 953
|
|
|
|
|
|
|
|
|
|
|
Droby, S. Vinokur, V. Weiss, B. Cohen, L. Daus, A. Goldschmidt, E. E. Porat, R.
Pág. 393 - 393
|
|
|
|
|
|