Characteristic measures of switching functions

DOI10.1016/0020-0255(77)90012-3zbMath0369.94019OpenAlexW2013766638MaRDI QIDQ1243267

Christos A. Papachristou

Publication date: 1977

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(77)90012-3

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Introduction to the theory of finite automata. Translated from the Russian. Translation edited by J.C. Shepherdson
• A Way to Simplify Truth Functions
• On the Inversion Complexity of a System of Functions
• An Approach to Multilevel Boolean Minimization
• Breaker Page
• On the problem of computational time and complexity of arithmetic functions
• On the Determination of the ps Maximal Implicants of a Switching Function
• A Survey and Assessment of Progress in Switching Theory and Logical Design in the Soviet Union
• A Formula for Logical Network Cost
• The Production of Completion Signals by Asynchronous, Iterative Networks
• Average Values of Quantities Appearing in Multiple Output Boolean Minimization
• Module Clustering to Minimize Delay in Digital Networks
• On the Time Required to Perform Addition
• The Time Required for Group Multiplication
• On the Time Required to Perform Multiplication
• The Logical Complexity of Geometric Properties in the Plane
• Multiple Reduction of Variable Dependency of Sequential Machines
• Bounds on Threshold Gate Realizability
• On the Delay Required to Realize Boolean Functions
• TOPI—A Special-Purpose Computer for Boolean Analysis and Synthesis
• Complexity of Partially Defined Combinational Switching Functions
• Time Bounds on Space Computations
• On the Theory of Boolean Formulas: Construction of the Set of the Formulas of Minimal Cost
• The Problem of Simplifying Truth Functions
• Lattice Theoretic Properties of Frontal Switching Functions
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)