Abstract
The solvability of a system of two boolean linear equations is considered. The methods of analytical number theory allow us to characterize the set of right-hand sides for which the system has solutions. A new approach is applicable to systems whose coefficients are bounded relative to the number of unknowns and whose right-hand sides are in the certain wide neighborhood of the middle point of the sum of coefficients (unlike the dynamic programming which is well suited only for small right-hand sides). The new method can also be used to design efficient algorithms.
Research supported by the Fund for Basic Research administrated by the Israel Academy of Sciences.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Alon and G. Freiman, On sums of subsets of a set of integers, Combinatorica, to appear.
A. A. Berstein, G. A. Freiman, Analytical methods of discrete optimization, Zely i. Resoursey w dologsrocnom planirovaniy, Moskva, ZEMJ (Russian) 89– 105 (1979).
P.L. Buzytsky, An effective formula for the number of solutions of linear Boolean equations, SIAM J. on Algebraic and Discrete Methods, Vol. 3, 1982, 182–186.
P. L. Buzytsky, G. A. Freiman, Analytical methods in integer programming, Moscow, ZEMJ, (Russian) 48pp. (1980).
P. L. Buzytsky, G. A. Freiman, Analytical methods in combinatorial problems, Izv. Acad. Nauk, SSSR, Ser. Tech Kibern. 2, (Russian) 2– – 12 (1980).
P. L. Buzytsky, G. A. Freiman, On a possibility to solve combinatorial problems by analytical methods, Ann. of the N. V. Acad. Sci. 337, 103– 117 (1980).
P. L. Buzytsky, G. A. Freiman, Integer programming and number theory, Ann. of the N. Y. Acad. Sci. 373, 191– 201 (1981).
P. L. Buzytsky, G. A. Freiman, An effective formula for the number of solutions of system of two 0.1-equations, Discr. Appl. Math. 6, 127– 133 (1983).
P. L. Buzytsky, G. A. Freiman, An effective formula for the number of solutions of system of OA-linear equationsAnn. of the N. Y. Acad. Sci. 410, 83– 90 (1983).
M. Chaimovich, Subset sum problem with different summands: computation, Discrete Applied Mathematics, to appear.
M. Chaimovich, New algorithms for one- and two-dimensional subset sum problems, in preparation.
M. Chaimovich, G. Freiman, Z. Galil, Solving dense subset sum problems by using analytical number theory, J. of Complexity, to appear.
P. Erdos and G. Freiman, On two additive problems, J. Number Theory, to appear.
G. A. Freiman, An analytical method of analysis of linear Boolean equations, Ann. New York Acad. Sci. 337 (1980), pp. 97–102.
G. A. Freiman, On extremal additive problems of Paul Erdos, Proceedings of Canberra Conference of Combinatorics, August 1987, ARS Combinatoria 26B, 93– 114 (1988).
G. A. Freiman, Subset sum problem with different summands, Proceeding of 20th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, 1989, submitted.
E. Lipkin, On representation of r-powers by subset sums, Acta Arithmetica, to appear.
S. Martello and P. Toth, A mixture of dynamic programming and branch-and- bound for the subset-sum problem, Management Science, vol. 30, no. 6, June 1984
A. Sarközy, Finite addition theorem, //, to appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Freiman, G. (1996). On Solvability of a System of Two Boolean Linear Equations. In: Chudnovsky, D.V., Chudnovsky, G.V., Nathanson, M.B. (eds) Number Theory: New York Seminar 1991–1995. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2418-1_10
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2418-1_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-94826-3
Online ISBN: 978-1-4612-2418-1
eBook Packages: Springer Book Archive