On the complexity of decoding Boolean cube splitting into cube faces

DOI10.1515/DMA.2008.012MaRDI QIDQ3184526zbMATH OpenFDO

Authors V. V. Osokin

Publication date 21 October 2009

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/DMA.2008.012

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• scientific article; zbMATH DE number 4053525
• Partial decoding of monotonic Boolean functions
• A decomposition of Boolean functions
• One approach to decoding monotone logical function
• scientific article; zbMATH DE number 1498461

Cites work

• Latent semantic indexing: A probabilistic analysis

Cited in

(5)

• Geometry of translations on a Boolean cube
• Information storage and search complexity theory
• Partial decoding of monotonic Boolean functions
• On learning monotone Boolean functions with irrelevant variables
• scientific article; zbMATH DE number 4053525 (Why is no real title available?)

This page was built for publication: On the complexity of decoding Boolean cube splitting into cube faces

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