scientific article; zbMATH DE number 5529977

zbMATH Open1155.93391MaRDI QIDQ3615217FDOQ3615217

Authors:

Publication date: 18 March 2009

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Control/observation systems involving computers (process control, etc.) (93C83)

Cited In (18)

• Title not available (Why is that?)
• High-accuracy asymptotic bounds for the realization complexity of function systems by iterative contact circuits
• 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
• One approach to synthesizing predicate circuits on the basis of generalized variables
• On the synthesis of oriented contact circuits with certain restrictions on adjacent contacts
• On the synthesis and complexity of formulae with bounded depth of alternation
• Ways of synthesizing binary programs admitting recursive call of procedures
• Use of the Kolmogorov complexity in analyzing control system dynamics
• Asymptotically best method for synthesis of Boolean recursive circuits
• Asymptotically best synthesis methods for reflexive-recursive circuits
• Depth of schemes embedded in a unit cube and implementing typical Boolean functions
• Refined bounds on Shannon's function for complexity of circuits of functional elements
• IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION
• Asymptotically sharp estimates for the area of multiplexers in the cellular circuit model
• Realization of Boolean functions by combinational circuits embedded in the hypercube
• High-accuracy bounds of the Shannon function for formula complexity in bases with direct and iterative variables
• Synthesis of asymptotically size-optimal Boolean circuits protected from functionality inference

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)