Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases

DOI10.1016/S0166-218X(02)00306-2zbMath0902.94033OpenAlexW1969204022MaRDI QIDQ4220200

V. A. Orlov

Publication date: 22 November 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00306-2

zbMATH Keywords

complexitymany-valued logic functionsalgorithmic problemasymptotics of the Shannon functionfunctionally complete basis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Many-valued logic (03B50)

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases