On pseudo-Boolean polynomials
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 3478774 (Why is no real title available?)
- An efficient algorithm for solving the problem of minimizing polynomials in Boolean variables with the connectedness property
- On a non-classical recognition problem
- Pseudo-Boolean Programming
Cited in
(10)- scientific article; zbMATH DE number 3889431 (Why is no real title available?)
- Quadratization of symmetric pseudo-Boolean functions
- On the number of pseudo-Boolean metric functions
- Certain problems associated with Boolean polynomials
- scientific article; zbMATH DE number 1543344 (Why is no real title available?)
- On the number of solutions to a system of Boolean equations
- scientific article; zbMATH DE number 3910310 (Why is no real title available?)
- On combinatorial properties of the knapsack problem
- scientific article; zbMATH DE number 3557812 (Why is no real title available?)
- Semi-regularity of pairs of Boolean polynomials
This page was built for publication: On pseudo-Boolean polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q267569)