Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Roth, J. Paul
1958.
Algebraic topological methods for the synthesis of switching systems. I.
Transactions of the American Mathematical Society,
Vol. 88,
Issue. 2,
p.
301.
Netherwood, Douglas B.
1958.
Logical Machine Design: A Selected Bibliography.
IEEE Transactions on Electronic Computers,
Vol. EC-7,
Issue. 2,
p.
155.
Rohleder, Hans
1959.
Ein Verfahren zum Aufstellen Optimaler Normalformen bei Gegebenen Primimplikanden.
Mathematical Logic Quarterly,
Vol. 5,
Issue. 14-24,
p.
334.
Rohleder, Hans
1960.
Vereinfachung der Synthese von gewissen Reihenparallelschaltungen durch Aufspalten in Teilprobleme.
ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik,
Vol. 40,
Issue. 1-3,
p.
125.
PRAWITZ, DAG
1960.
An improved proof procedure1.
Theoria,
Vol. 26,
Issue. 2,
p.
102.
Mott, Thomas H.
1960.
Determination of the Irredundant Normal Forms of a Truth Function by Iterated Consensus of the Prime Implicants.
IEEE Transactions on Electronic Computers,
Vol. EC-9,
Issue. 2,
p.
245.
Chu, J. T.
1961.
A Generalization of a Theorem of Quine for Simplifying Truth Functions.
IEEE Transactions on Electronic Computers,
Vol. EC-10,
Issue. 2,
p.
165.
McCluskey, E. J.
1961.
Minimal sums for Boolean functions having many unspecified fundamental products.
p.
10.
Samson, E. W.
and
Calabi, L.
1962.
Research and algorithms in the theory of Boolean formulas.
p.
25.
Meo, Angelo Raffaele
1962.
On the minimal third order expression of a Boolean function.
p.
5.
Samson, E. W.
and
Calabi, L.
1963.
On the Theory of Boolean Formulas: Minimal Including Sums, II.
Journal of the Society for Industrial and Applied Mathematics,
Vol. 11,
Issue. 2,
p.
224.
Samson, E. W.
and
Calabi, L.
1963.
On the Theory of Boolean Formulas: Minimal Including Sums, I.
Journal of the Society for Industrial and Applied Mathematics,
Vol. 11,
Issue. 2,
p.
212.
BRAUN, EDWARD L.
1963.
Digital Computer Design.
p.
38.
Hazeltine, Barrett
1964.
Construction of Irredundant Multilevel Switching Functions.
IEEE Transactions on Electronic Computers,
Vol. EC-13,
Issue. 4,
p.
468.
Das, S. R.
and
Choudhury, A. K.
1965.
Maxterm Type Expressions of Switching Functions and Their Prime Implicants.
IEEE Transactions on Electronic Computers,
Vol. EC-14,
Issue. 6,
p.
920.
Meo, Angelo R.
1965.
On the Determination of the ps Maximal Implicants of a Switching Function.
IEEE Transactions on Electronic Computers,
Vol. EC-14,
Issue. 6,
p.
830.
DAS, SUNIL RANJAN
ROY, K. K.
and
CHOUDHURY, A. K.
1966.
Simplification of Switching Functions Involving a very Large Number of ‘Don't Care’ States†.
International Journal of Control,
Vol. 3,
Issue. 1,
p.
17.
Umezawa, Toshio
1967.
A Method of Two-Level Simplification of Boolean Functions.
Nagoya Mathematical Journal,
Vol. 29,
Issue. ,
p.
201.
Mayoh, B.H.
1968.
On finding optimal covers.
International Journal of Computer Mathematics,
Vol. 2,
Issue. 1-4,
p.
57.
Das, S.R.
1971.
Comments on " ANew Algorithm for Generating Prime Implicants".
IEEE Transactions on Computers,
Vol. C-20,
Issue. 12,
p.
1614.