On the complexity of decoding Boolean cube splitting into cube faces
From MaRDI portal
Publication:3184526
DOI10.1515/DMA.2008.012zbMath1192.68230MaRDI QIDQ3184526
Publication date: 21 October 2009
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20)
Related Items (2)
Information storage and search complexity theory ⋮ On learning monotone Boolean functions with irrelevant variables
Cites Work
This page was built for publication: On the complexity of decoding Boolean cube splitting into cube faces