Quasimonotone Boolean Functions and Bistellar Graphs

DOI10.1016/S0167-5060(08)70043-8zbMath0455.05049OpenAlexW12956107MaRDI QIDQ3903040

Peter L. Hammer

Publication date: 1980

Published in: Combinatorics 79 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70043-8

zbMATH Keywords

Boolean functionsNP-completestar graphsinteger quadratic programmingbistellar graphquadratic 0-1 optimization problems

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Integer programming (90C10) Quadratic programming (90C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items

Unimodular functions, Bipartite dimensions and bipartite degrees of graphs, Pseudo-Boolean optimization, Consensus algorithms for the generation of all maximal bicliques, Computational complexity of norm-maximization, On the supermodular knapsack problem, On the stable set problem in special \(P_{5}\)-free graphs