| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419280 | Discrete Applied Mathematics | 2015 | 7 Pages |
Abstract
The clones of Boolean functions are classified in regard to set-reconstructibility via a strong dichotomy result: the clones containing only affine functions, conjunctions, disjunctions or constant functions are set-reconstructible, whereas the remaining clones are not weakly reconstructible.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Miguel Couceiro, Erkko Lehtonen, Karsten Schölzel,