Journal ArticleDOI
The synthesis of two-terminal switching circuits
Reads0
Chats0
TLDR
A basic part of the general synthesis problem is the design of a two-terminal network with given operating characteristics, and this work shall consider some aspects of this problem.Abstract:
THE theory of switching circuits may be divided into two major divisions, analysis and synthesis. The problem of analysis, determining the manner of operation of a given switching circuit, is comparatively simple. The inverse problem of finding a circuit satisfying certain given operating conditions, and in particular the best circuit is, in general, more difficult and more important from the practical standpoint. A basic part of the general synthesis problem is the design of a two-terminal network with given operating characteristics, and we shall consider some aspects of this problem.read more
Citations
More filters
Book ChapterDOI
The Complexity of Computations
TL;DR: This chapter provides a survey of the main concepts and results of the computational complexity theory, starting with basic concepts such as time and space complexities, complexity classes P and NP, and Boolean circuits and two related ways to make computations more efficient.
Proceedings ArticleDOI
Improved low complexity fully parallel thinning algorithm
TL;DR: A fully parallel iterative thinning algorithm called MB2 is presented, which favourably competes with the best known algorithms regarding homotopy, mediality, thickness, rotation invariance and noise immunity, while featuring a speed improvement by a factor of two or more owing to a smaller number of operations to perform.
Journal ArticleDOI
SIGACT news complexity theory column 42
TL;DR: Here is a real gift to the field from David Johnson: After a thirteen year intermission, David is restarting his NP-completeness column, and his column will now appear about twice yearly in ACM Transactions on Algorithms.
Journal ArticleDOI
Detection of group invariance or total symmetry of a Boolean function
TL;DR: In this paper, a method for determining whether a Boolean function possesses any group invariance is presented, that is, whether there are any permutations or primings of the independent variables which leave the function unchanged.
Journal ArticleDOI
Transforming Probabilities With Combinational Logic
TL;DR: Novel techniques for synthesizing combinational logic that transforms source probabilities into different target probabilities are demonstrated, showing that for any integer n ≥ 2, there exists a single probability that can be transformed into arbitrary base-n fractional probabilities.
References
More filters
Journal ArticleDOI
A logical calculus of the ideas immanent in nervous activity
Warren S. McCulloch,Walter Pitts +1 more
TL;DR: In this article, it is shown that many particular choices among possible neurophysiological assumptions are equivalent, in the sense that for every net behaving under one assumption, there exists another net which behaves under another and gives the same results, although perhaps not in the same time.
Journal ArticleDOI
A symbolic analysis of relay and switching circuits
TL;DR: It will be shown that several of the well-known theorems on impedance networks have roughly analogous theorem in relay circuits, including the delta-wye and star-mesh transformations, and the duality theorem.
Book
The axiomatic method in biology
TL;DR: Interestingly, the axiomatic method in biology that you really wait for now is coming, and it's significant to wait for the representative and beneficial books to read.
Journal ArticleDOI
The Number of Two-Terminal Series-Parallel Networks
John Riordan,Claude E. Shannon +1 more