Characteristic measures of switching functions

Cites work

scientific article; zbMATH DE number 3425574 (Why is no real title available?)
scientific article; zbMATH DE number 3129327 (Why is no real title available?)
scientific article; zbMATH DE number 3133387 (Why is no real title available?)
scientific article; zbMATH DE number 3150816 (Why is no real title available?)
scientific article; zbMATH DE number 3155126 (Why is no real title available?)
scientific article; zbMATH DE number 3183405 (Why is no real title available?)
scientific article; zbMATH DE number 3205680 (Why is no real title available?)
scientific article; zbMATH DE number 3209190 (Why is no real title available?)
scientific article; zbMATH DE number 3212020 (Why is no real title available?)
scientific article; zbMATH DE number 3214539 (Why is no real title available?)
scientific article; zbMATH DE number 3218179 (Why is no real title available?)
scientific article; zbMATH DE number 3248024 (Why is no real title available?)
scientific article; zbMATH DE number 3248816 (Why is no real title available?)
scientific article; zbMATH DE number 3257823 (Why is no real title available?)
scientific article; zbMATH DE number 3267132 (Why is no real title available?)
scientific article; zbMATH DE number 3285248 (Why is no real title available?)
scientific article; zbMATH DE number 3305071 (Why is no real title available?)
scientific article; zbMATH DE number 3319548 (Why is no real title available?)
scientific article; zbMATH DE number 3319969 (Why is no real title available?)
scientific article; zbMATH DE number 3322464 (Why is no real title available?)
scientific article; zbMATH DE number 3335923 (Why is no real title available?)
scientific article; zbMATH DE number 3190323 (Why is no real title available?)
scientific article; zbMATH DE number 3190324 (Why is no real title available?)
A Formula for Logical Network Cost
A Survey and Assessment of Progress in Switching Theory and Logical Design in the Soviet Union
A Way to Simplify Truth Functions
An Approach to Multilevel Boolean Minimization
Average Values of Quantities Appearing in Multiple Output Boolean Minimization
Bounds on Threshold Gate Realizability
Breaker Page
Complexity of Partially Defined Combinational Switching Functions
Introduction to the theory of finite automata. Translated from the Russian. Translation edited by J.C. Shepherdson
Lattice Theoretic Properties of Frontal Switching Functions
Module Clustering to Minimize Delay in Digital Networks
Multiple Reduction of Variable Dependency of Sequential Machines
On the Delay Required to Realize Boolean Functions
On the Determination of the ps Maximal Implicants of a Switching Function
On the Inversion Complexity of a System of Functions
On the Theory of Boolean Formulas: Construction of the Set of the Formulas of Minimal Cost
On the Time Required to Perform Addition
On the Time Required to Perform Multiplication
On the problem of computational time and complexity of arithmetic functions
TOPI—A Special-Purpose Computer for Boolean Analysis and Synthesis
The Logical Complexity of Geometric Properties in the Plane
The Problem of Simplifying Truth Functions
The Production of Completion Signals by Asynchronous, Iterative Networks
The Time Required for Group Multiplication
The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
Time Bounds on Space Computations

This page was built for publication: Characteristic measures of switching functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1243267)