On the complexity of realizing the powers of a Boolean \((n,n)\)-function

zbMATH Open0817.94029MaRDI QIDQ1345680

O. B. Lupanov

Publication date: 13 August 1995

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

complexityupper boundsdepthcircuitsBoolean function

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15)

Related Items (1)

Title not available (Why is that?)

This page was built for publication: On the complexity of realizing the powers of a Boolean \((n,n)\)-function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1345680)