On difficulties of solving a problem of decomposition of the system of boolean equations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)
KeywordsPolynomial Time Boolean Function Equation System Machine Time Unit Cube
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.Zhuravlev Yu.I.,Kogan A.Yu. An algorithm for constructing a disjunctive normal form equivalent to the multiplication of left parts of Boolean equations of Nelson type. // J.Vichisl.Math.&Math.Phiziki. —1986 — v.26,No.8,p.1243–1250.(Russian)Google Scholar
- 2.Safarian A.A. On the solution of systems of Boolean equations arising at construction of Nelson type tests and systems. // J.Vichisl.Math.& Math.Phiziki, — 1984 — v.24,No.10,p.1590–1593 (Russian).Google Scholar
- 3.Safarian A.A. NP-completeness of decomposition problem of Boolean equation systems on minimal blocks. // Soobschenia po prikladnoy matematike. — Comp.Centre of USSR Academy of Sciences — (Russian).Google Scholar
© Springer-Verlag Berlin Heidelberg 1987