Minor complexity of discrete functions
In this paper we study a class of complexity measures, induced by a new data structure for representing k-valued functions (operations), called minor decision diagram. When assigning values to some variables in a function the resulting functions are called subfunctions, and when identifying some var...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Emerald Publishing
2021-01-01
|
| Series: | Applied Computing and Informatics |
| Subjects: | |
| Online Access: | https://www.emerald.com/insight/content/doi/10.1016/j.aci.2018.07.003/full/pdf |