The worst case behavior of a greedy algorithm for a class of pseudo- Boolean functions

DOI10.1016/0166-218X(89)90018-8MaRDI QIDQ1121245zbMATH OpenOpenAlexFDO

Authors M. Reza Emamy-K.

Publication date 1989

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(89)90018-8

zbMATH Keywords

completely unimodal pseudo-Boolean functionsgreedy algorithmn-cube

Mathematics Subject Classification ID

Recommendations

• From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions
• scientific article; zbMATH DE number 1182572
• Recognition of a class of unimodular functions
• scientific article; zbMATH DE number 4162661
• scientific article; zbMATH DE number 3950207

Cites work

• From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions
• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• scientific article; zbMATH DE number 3385535 (Why is no real title available?)
• Lengths of snakes in boxes
• Some results in combinatorial geometry

Cited in

(1)

• Performance analysis of a greedy algorithm for inferring Boolean functions

This page was built for publication: The worst case behavior of a greedy algorithm for a class of pseudo- Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121245)