scientific article; zbMATH DE number 15477

MaRDI QIDQ3972115zbMATH OpenFDO

Authors Z. E. Koroleva

Publication date 25 June 1992

zbMATH Keywords

finite automataBoolean circuitfinite basis of elementary gateslength of paths from inputs to outputrestricted fan-in

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logical aspects of Boolean algebras (03G05)

Recommendations

• scientific article; zbMATH DE number 850402
• On the complexity of realization of partial Boolean functions by circuits of functional elements
• scientific article; zbMATH DE number 4187721
• scientific article; zbMATH DE number 850321
• scientific article; zbMATH DE number 4170848
• On the complexity of circuit realization of Boolean functions in an infinite basis
• scientific article; zbMATH DE number 2095572
• On the complexity and depth of circuits that realize partial Boolean functions
• The complexity of Boolean function implementation in some classes of automaton circuits
• On the complexity of realization of Boolean functions by formulas

Cited in

(7)

• On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions
• To the problem of realizability of Boolean functions by circuits in a basis of unreliable functional elements
• Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases
• Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity
• The complexity of Boolean function implementation in some classes of automaton circuits
• scientific article; zbMATH DE number 609985 (Why is no real title available?)
• scientific article; zbMATH DE number 4187721 (Why is no real title available?)

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 Q3972115)