On asymptotic estimates of the complexity of circuit realization of languages
From MaRDI portal
Publication:2563374
zbMATH Open0856.68085MaRDI QIDQ2563374FDOQ2563374
Authors: M. V. Cherkashin 
Publication date: 11 December 1996
Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)
Recommendations
- On the complexity of realization of finite languages by formulas
- Complexity of monotonic functions
- Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits
- Asymptotic behavior of the Shannon function for a class of circuits of functional elements.
- Refined bounds on Shannon's function for complexity of circuits of functional elements
Cited In (7)
- Title not available (Why is that?)
- Circuit complexity and the expressive power of generalized first-order formulas
- Asymptotical behaviour of some non-uniform measures
- Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits
- On the relative complexity of some languages in \(NC^ 1\)
- On the complexity of realization of finite languages by formulas
- Generalised Entropy and Asymptotic Complexities of Languages
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)
