On asymptotic estimates of the complexity of circuit realization of languages
From MaRDI portal
Publication:2563374
zbMATH Open0856.68085MaRDI QIDQ2563374
Publication date: 11 December 1996
Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)
Related Items (2)
On the relative complexity of some languages in \(NC^ 1\) ⋮ Circuit complexity and the expressive power of generalized first-order formulas
This page was built for publication: On asymptotic estimates of the complexity of circuit realization of languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563374)
