scientific article; zbMATH DE number 279581

zbMATH Open0785.90070MaRDI QIDQ5289554FDOQ5289554

Bruno Simeone, Yanpei Liu, Peter L. Hammer

Publication date: 23 August 1993

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

Recommendations

• scientific article
• 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

zbMATH Keywords

NP-completenessBoolean equationquasi-Boolean function

Mathematics Subject Classification ID

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

Cited In (7)

• Title not available (Why is that?)
• Boolean approaches to graph embeddings related to VLSI
• Component model for a NP-hard problem
• Boolean Methods of Optimization over Independence Systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Pseudo-Boolean optimization with a disjunctive constraint

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)