Abstract
Systems of Boolean equations are considered. The order of maximal consistent subsystems is estimated in the general and “typical” (in a probability sense) cases. Applications for several well-known discrete problems are given.
Similar content being viewed by others
References
S. Rudeany, Boolean Function and Equations (North-Holland, Amsterdam, 1974).
V. K. Leont’ev and G. P. Tonoyan, “Approximate solutions of systems of Boolean equations,” Comput. Math. Math. Phys. 33, 1221–1227 (1993).
V. K. Leont’ev, “An upper bound for the α-height of (0, 1)-matrices,” Math. Notes 15, 245–250 (1974).
V. K. Leont’ev, “Symmetric Boolean polynomials,” Comput. Math. Math. Phys. 50, 1447–1458 (2010).
V. I. Levenshtein, “Elements of coding theory,” in Discrete Mathematics and Mathematical Problems in Cybernetics (Nauka, Moscow, 1974), pp. 207–305 [in Russian].
A. A. Sapozhenko, Dedekind’s Problem and the Method of Boundary Functionals (Fizmatlit, Moscow, 2009) [in Russian].
M. N. Vyalyi, V. K. Leont’ev, and M. V. Osetrov, “Monotone Boolean polynomials,” Diskret. Anal. Issled. Operatsii, Ser. 1 9(4), 41–49 (2002).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.K. Leont’ev, G.P. Tonoyan, 2013, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2013, Vol. 53, No. 5, pp. 800–807.
Rights and permissions
About this article
Cite this article
Leont’ev, V.K., Tonoyan, G.P. On systems of Boolean equations. Comput. Math. and Math. Phys. 53, 632–639 (2013). https://doi.org/10.1134/S0965542513050084
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0965542513050084