scientific article; zbMATH DE number 279581

MaRDI QIDQ5289554zbMATH OpenFDO

Authors Peter L. Hammer, Yanpei Liu, Bruno Simeone

Publication date 23 August 1993

zbMATH Keywords

Boolean equationNP-completenessquasi-Boolean function

Mathematics Subject Classification ID

Boolean programming (90C09) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 169103
• Decomposability of partially defined Boolean functions
• Hardness and methods to solve CLIQUE
• On complexity of Boolean matrix polynomials solving
• Solving systems of linear equations with Boolean variables

Cited in

(8)

• Boolean approaches to graph embeddings related to VLSI
• Pseudo-Boolean optimization with a disjunctive constraint
• Polynomial fill-in puzzles or how to make sense of the cook-Levin theorem
• Boolean Methods of Optimization over Independence Systems
• Component model for a NP-hard problem
• scientific article; zbMATH DE number 169103 (Why is no real title available?)
• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• scientific article; zbMATH DE number 4187850 (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 Q5289554)