scientific article; zbMATH DE number 3867065
From MaRDI portal
Publication:3335526
Recommendations
Cited in
(18)- Computational bound on complexity of polynomial representations of Boolean functions
- An efficient algorithm for solving the problem of minimizing polynomials in Boolean variables with the connectedness property
- scientific article; zbMATH DE number 4179291 (Why is no real title available?)
- scientific article; zbMATH DE number 3847216 (Why is no real title available?)
- scientific article; zbMATH DE number 4147860 (Why is no real title available?)
- Some Theorems Concerning the Core Function
- Minimal polynomial of Cayley graph adjacency matrix for Boolean functions
- The Complexity of Boolean Formula Minimization
- scientific article; zbMATH DE number 3914086 (Why is no real title available?)
- The scheme complexity of discrete optimization
- Fixed-parameter Approximability of Boolean MinCSPs
- scientific article; zbMATH DE number 4000860 (Why is no real title available?)
- The Minimization Problem for Boolean Formulas
- scientific article; zbMATH DE number 1432158 (Why is no real title available?)
- An upper bound for complexity of polynomial normal forms of Boolean functions
- On the mean evaluation of polynomially reducible Boolean functions
- An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix
- The complexity of Boolean formula minimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3335526)
