scientific article; zbMATH DE number 3867065

zbMATH Open0544.90075MaRDI QIDQ3335526FDOQ3335526

Authors: Alexander Ageev 

Publication date: 1983

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

set covering problempolynomial solvability

Mathematics Subject Classification ID

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

Cited In (16)

• The complexity of Boolean formula minimization
• An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix
• Some Theorems Concerning the Core Function
• Fixed-parameter Approximability of Boolean MinCSPs
• Title not available (Why is that?)
• An efficient algorithm for solving the problem of minimizing polynomials in Boolean variables with the connectedness property
• Title not available (Why is that?)
• Minimal polynomial of Cayley graph adjacency matrix for Boolean functions
• An upper bound for complexity of polynomial normal forms of Boolean functions
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)

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)