Complexity in Information Theory

By Yaser S. Abu-Mostafa. 1988

Citations in the corpus

• A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions (2004, unknown): “NPN-Representative Simplest Modified RA model Simplest AC circuit DFC C data Simplest Modified RA circuit Table 3 shows that in three NPN classes (4, 7, 9) MRA and AC give equivalent complexity decompositions.”