A polynomial algorithm for minimal interval representation

DOI10.1016/0196-6774(92)90055-HMaRDI QIDQ4015277zbMATH OpenOpenAlexFDO

Authors A. Fischer, Itzhak Gilboa, Moshe Shpitalni

Publication date 12 January 1993

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(92)90055-h

zbMATH Keywords

Boolean functionGray codeunique minimal representation

Mathematics Subject Classification ID

Theory of data (68P99) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Computing the minimum DNF representation of Boolean functions defined by intervals
• Recognition of interval Boolean functions
• Recognition of tractable DNFs representable by a constant number of intervals
• Properties of the interval graph of a Boolean function
• A minimization method for boolean functions

Cited in

(3)

• Recognition of tractable DNFs representable by a constant number of intervals
• Matching Integer Intervals by Minimal Sets of Binary Words with don’t cares
• scientific article; zbMATH DE number 5874901 (Why is no real title available?)

This page was built for publication: A polynomial algorithm for minimal interval representation

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