Minor complexities of finite operations
Slavcho Shtrakov

TL;DR
This paper introduces a new class of complexity measures for k-valued functions using minor decision diagrams, analyzing their properties, classifications, and implications for multi-valued logic circuits.
Contribution
It presents a novel complexity measure based on minor decision diagrams and classifies k-valued functions through equivalence relations and transformation groups.
Findings
Functions with non-trivial arity gap have all sets of essential variables separable.
Classification of k-valued functions based on minor complexities.
Analysis of transformation groups related to function classifications.
Abstract
In this paper we present a new class of complexity measures, induced by a new data structure for representing -valued functions (operations), called minor decision diagram. The results are presented in terms of Multi-Valued Logic circuits (MVL-circuits), ordered decision diagrams, formulas and minor decomposition trees. When assigning values to some variables in a function the resulting function is a subfunction of , and when identifying some variables the resulting function is a minor of . A set of essential variables in is separable if there is a subfunction of , whose set of essential variables is . The essential arity gap of the function is the minimum number of essential variables in which become fictive when identifying distinct essential variables in . We prove that, if a function has non-trivial arity gap (), then…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Low-power high-performance VLSI design · VLSI and Analog Circuit Testing
