This article is cited in 1 scientific paper (total in 1 paper)
On the complexity of the satisfiability problem for a system of functional Boolean equations
V. S. Fedorova
Lomonosov Moscow State University, Leninskie gory, 119991 Moscow, Russia
Functional Boolean equations and the satisfiability problem for them are considered. The satisfiability problem is the following: is there any solution to the functional equation among Boolean functions? The upper and the lower bounds on the complexity of the satisfiability problem for a system of functional Boolean equations are established. This result shows that it is impossible to solve a system of functional Boolean equations by the method which has much less complexity than the method of direct enumeration. Bibliogr. 10.
functional Boolean equation, satisfiability problem, complexity.
PDF file (291 kB)
Journal of Applied and Industrial Mathematics, 2013, 7:3, 344–354
V. S. Fedorova, “On the complexity of the satisfiability problem for a system of functional Boolean equations”, Diskretn. Anal. Issled. Oper., 20:3 (2013), 84–100; J. Appl. Industr. Math., 7:3 (2013), 344–354
Citation in format AMSBIB
\paper On the complexity of the satisfiability problem for a~system of functional Boolean equations
\jour Diskretn. Anal. Issled. Oper.
\jour J. Appl. Industr. Math.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
I. S. Kalinina, S. S. Marchenkov, “On complexity of problem of satisfiability for systems of countable-valued functional equations”, Russian Math. (Iz. VUZ), 59:8 (2015), 19–24
|Number of views:|