scientific article; zbMATH DE number 5529977
From MaRDI portal
Publication:3615217
Cited in
(18)- IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION
- High-accuracy bounds of the Shannon function for formula complexity in bases with direct and iterative variables
- Ways of synthesizing binary programs admitting recursive call of procedures
- Use of the Kolmogorov complexity in analyzing control system dynamics
- On the synthesis and complexity of formulae with bounded depth of alternation
- Asymptotically sharp estimates for the area of multiplexers in the cellular circuit model
- Realization of Boolean functions by combinational circuits embedded in the hypercube
- Asymptotically best method for synthesis of Boolean recursive circuits
- scientific article; zbMATH DE number 7561759 (Why is no real title available?)
- On the synthesis of oriented contact circuits with certain restrictions on adjacent contacts
- High-accuracy asymptotic bounds for the realization complexity of function systems by iterative contact circuits
- One approach to synthesizing predicate circuits on the basis of generalized variables
- Asymptotically best synthesis methods for reflexive-recursive circuits
- Depth of schemes embedded in a unit cube and implementing typical Boolean functions
- Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3
- Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits
- Synthesis of asymptotically size-optimal Boolean circuits protected from functionality inference
- Refined bounds on Shannon's function for complexity of circuits of functional elements
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3615217)
