An effective formula for the number of solutions of a system of two 0,1- equations

DOI10.1016/0166-218X(83)90066-5zbMath0524.90062OpenAlexW1977749330MaRDI QIDQ585085

P. L. Buzytsky, Gregory A. Freiman

Publication date: 1983

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(83)90066-5

zbMATH Keywords

knapsack problemanalytic number theoryapproximation of the number of solutionslinear Boolean equation system

Mathematics Subject Classification ID

Boolean programming (90C09) Linear Diophantine equations (11D04)

Related Items (1)

Solving dense subset-sum problems by using analytical number theory

Cites Work

• An Effective Formula for the Number of Solutions of Linear Boolean Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An effective formula for the number of solutions of a system of two 0,1- equations