Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
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.
Dunham, B.
Fridshal, R.
and
North, J. H.
1961.
DIVISION OF MATHEMATICS: SYMBOLIC LOGIC AND COMPUTING MACHINES: SOME GENERAL REFLECTIONS AND PREJUDICES*.
Transactions of the New York Academy of Sciences,
Vol. 24,
Issue. 1 Series II,
p.
58.
Cobham, A.
Fridshal, R.
and
North, J. H.
1961.
An application of linear programming to the minimization of Boolean functions.
p.
3.
Hazeltine, Barrett
1964.
Construction of Irredundant Multilevel Switching Functions.
IEEE Transactions on Electronic Computers,
Vol. EC-13,
Issue. 4,
p.
468.
Necula, N. N.
1967.
A Numerical Procedure for Determination of the Prime Implicants of a Boolean Function.
IEEE Transactions on Electronic Computers,
Vol. EC-16,
Issue. 5,
p.
687.
Mayoh, B. H.
1967.
On the Simplification of Logical Expressions.
SIAM Journal on Applied Mathematics,
Vol. 15,
Issue. 4,
p.
898.
Mayoh, B.H.
1968.
On finding optimal covers.
International Journal of Computer Mathematics,
Vol. 2,
Issue. 1-4,
p.
57.
Dunham, Bradford
and
Wang, Hao
1976.
Towards feasible solutions of the tautology problem.
Annals of Mathematical Logic,
Vol. 10,
Issue. 2,
p.
117.
Wang, Hao
1976.
Computation, Logic, Philosophy.
p.
246.
Chandra, Ashok K.
and
Markowsky, George
1978.
On the number of prime implicants.
Discrete Mathematics,
Vol. 24,
Issue. 1,
p.
7.
Besslich
1983.
A Method for the Generation and Processing of Dyadic Indexed Data.
IEEE Transactions on Computers,
Vol. C-32,
Issue. 5,
p.
487.
Sasao
1985.
An Algorithm to Derive the Complement of a Binary Function with Multiple-Valued Inputs.
IEEE Transactions on Computers,
Vol. C-34,
Issue. 2,
p.
131.
Besslich, Ph. W.
1985.
Spectral Techniques and Fault Detection.
p.
91.
Besslich
1986.
Heuristic Minimization of MVL Functions: A Direct Cover Approach.
IEEE Transactions on Computers,
Vol. C-35,
Issue. 2,
p.
134.
Cutler
and
Muroga
1987.
Derivation of Minimal Sums for Completely Specified Functions.
IEEE Transactions on Computers,
Vol. C-36,
Issue. 3,
p.
277.
Chan
1987.
Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs.
IEEE Transactions on Computers,
Vol. C-36,
Issue. 2,
p.
212.
Sapozhenko, A. A.
and
Chukhrov, I. P.
1989.
Boolean function minimization in the class of disjunctive normal forms.
Journal of Soviet Mathematics,
Vol. 46,
Issue. 4,
p.
2021.
Hong, S.J.
and
Muroga, S.
1991.
Absolute minimization of completely specified switching functions.
IEEE Transactions on Computers,
Vol. 40,
Issue. 1,
p.
53.
Sasao, Tsutomu
1996.
Representations of Discrete Functions.
p.
269.
Sasao, T.
and
Butler, J.T.
1997.
Comparison of the worst and best sum-of-products expressions for multiple-valued functions.
p.
55.