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

DOI10.1016/0166-218X(83)90066-5MaRDI QIDQ585085zbMATH OpenOpenAlexFDO

Authors P. L. Buzytsky, G. 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)

Cites work

• scientific article; zbMATH DE number 3968334 (Why is no real title available?)
• scientific article; zbMATH DE number 3717407 (Why is no real title available?)
• scientific article; zbMATH DE number 3719153 (Why is no real title available?)
• An Effective Formula for the Number of Solutions of Linear Boolean Equations

Cited in

(1)

• Solving dense subset-sum problems by using analytical number theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q585085)