scientific article
From MaRDI portal
Publication:3615217
zbMath1155.93391MaRDI QIDQ3615217
No author found.
Publication date: 18 March 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (16)
Asymptotically best synthesis methods for reflexive-recursive circuits ⋮ Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits ⋮ Depth of schemes embedded in a unit cube and implementing typical Boolean functions ⋮ High-accuracy asymptotic bounds for the realization complexity of function systems by iterative contact circuits ⋮ IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION ⋮ Realization of Boolean functions by combinational circuits embedded in the hypercube ⋮ One approach to synthesizing predicate circuits on the basis of generalized variables ⋮ On the synthesis and complexity of formulae with bounded depth of alternation ⋮ Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3 ⋮ Unnamed Item ⋮ On the synthesis of oriented contact circuits with certain restrictions on adjacent contacts ⋮ Синтез асимптотически оптимальных по сложности схем из функциональных элементов, защищенных от раскрытия функциональности ⋮ Ways of synthesizing binary programs admitting recursive call of procedures ⋮ High-accuracy bounds of the Shannon function for formula complexity in bases with direct and iterative variables ⋮ Asymptotically best method for synthesis of Boolean recursive circuits ⋮ Refined bounds on Shannon's function for complexity of circuits of functional elements
This page was built for publication:
