scientific article; zbMATH DE number 4176981

zbMATH Open0714.94018MaRDI QIDQ3200985FDOQ3200985

Authors: N. A. Shkalikova 

Publication date: 1989

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

Recommendations

• On a basis for schemes consisting of cellular elements
• On the comparison of complexity of two ways of realization of some linear Boolean functions
• scientific article; zbMATH DE number 4170848
• scientific article; zbMATH DE number 647645
• Computational complexity of Boolean functions

zbMATH Keywords

complexityBoolean functionsthree-dimensional cellular circuitstwo-dimensional cellular circuit

Mathematics Subject Classification ID

Analytic circuit theory (94C05)

Cited In (16)

• Title not available (Why is that?)
• Estimates for the number of Boolean functions realized by an initial Boolean automaton with three constant states
• Title not available (Why is that?)
• On the activity of cell circuits realising the system of all conjunctions
• Canonical Form and Synthesis of Cellular Cascades
• On realization of partitions of sets by circuits of functional elements
• Title not available (Why is that?)
• A Two-Rail Cascade Synthesis of Boolean Functions
• Title not available (Why is that?)
• Maximum cellular boolean functions and perfect gray codes
• On a basis for schemes consisting of cellular elements
• On the asymptotics of the complexity of a universal cellular switching network
• Generalization of cardinality estimates for plane circuits realizing partial Boolean operators
• The implementation of certain classes of Boolean functions in iterative networks
• Asymptotically sharp estimates for the area of multiplexers in the cellular circuit model
• The minimal volume of memory necessary for realizing the functions of Boolean algebra by converter circuits

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