General upper bound of circuit complexity in an arbitrary infinite complete base
From MaRDI portal
Publication:1275996
zbMath0909.94023MaRDI QIDQ1275996
Publication date: 14 January 1999
Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)
Related Items (3)
Orders of growth of Shannon functions for circuit complexity over infinite bases ⋮ ON LOWER BOUNDS FOR COMPLEXITY OVER INFINITE BASISES FOR FUNCTIONS OF MULTI-VALUED LOGIC ⋮ On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates
This page was built for publication: General upper bound of circuit complexity in an arbitrary infinite complete base
