This is a preview of subscription content, log in via an institution to check access.
References
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)
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).
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).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Safarian, A.A. (1987). On difficulties of solving a problem of decomposition of the system of boolean equations. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_82
Download citation
DOI: https://doi.org/10.1007/3-540-18740-5_82
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18740-0
Online ISBN: 978-3-540-48138-6
eBook Packages: Springer Book Archive