Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases (Q4220200)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases |
scientific article; zbMATH DE number 1225799
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases |
scientific article; zbMATH DE number 1225799 |
Statements
Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases (English)
0 references
22 November 1998
0 references
many-valued logic functions
0 references
algorithmic problem
0 references
complexity
0 references
asymptotics of the Shannon function
0 references
functionally complete basis
0 references
