scientific article; zbMATH DE number 3867065

MaRDI QIDQ3335526zbMATH OpenFDO

Authors Alexander Ageev

Publication date 1983

zbMATH Keywords

set covering problempolynomial solvability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean programming (90C09)

Recommendations

• scientific article; zbMATH DE number 4147860
• scientific article; zbMATH DE number 3914086
• scientific article; zbMATH DE number 3847216
• An upper bound for complexity of polynomial normal forms of Boolean functions
• The Minimization Problem for Boolean Formulas

Cited in

(16)

• scientific article; zbMATH DE number 4179291 (Why is no real title available?)
• The complexity of Boolean formula minimization
• Some Theorems Concerning the Core Function
• An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix
• Fixed-parameter Approximability of Boolean MinCSPs
• scientific article; zbMATH DE number 3847216 (Why is no real title available?)
• An efficient algorithm for solving the problem of minimizing polynomials in Boolean variables with the connectedness property
• scientific article; zbMATH DE number 4147860 (Why is no real title available?)
• Minimal polynomial of Cayley graph adjacency matrix for Boolean functions
• An upper bound for complexity of polynomial normal forms of Boolean functions
• scientific article; zbMATH DE number 3914086 (Why is no real title available?)
• The Minimization Problem for Boolean Formulas
• On the mean evaluation of polynomially reducible Boolean functions
• Computational bound on complexity of polynomial representations of Boolean functions
• The Complexity of Boolean Formula Minimization
• scientific article; zbMATH DE number 4000860 (Why is no real title available?)

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)