DocumentCode
1356064
Title
Absolute Minimal Expressions of Boolean Functions
Author
Abhyankar, Shreeram
Author_Institution
Cornell University, Ithaca, N. Y.
Issue
1
fYear
1959
fDate
3/1/1959 12:00:00 AM
Firstpage
3
Lastpage
8
Abstract
In this paper we make a beginning in the hitherto unexplored problem of finding absolute minimal expressions of Boolean functions. We shall adhere to the notations and terminology introduced in our previous paper,1 which will be referred to as S. In the present paper, we shall find absolute minimals for Boolean functions whose point set complex consists of either one or two points. The case of one point is in Theorem 1, Section I. The case when the two points form a 1-cell is covered by Theorem 4, Section I which discusses an arbitrary dimensional cell. The case when the cell complex consists of two isolated points, the main theme of this paper, is dealt with in Section II.
Keywords
Boolean functions; Circuit analysis computing; Circuit synthesis; Hydrogen; Military computing; Terminology; Tin;
fLanguage
English
Journal_Title
Electronic Computers, IRE Transactions on
Publisher
ieee
ISSN
0367-9950
Type
jour
DOI
10.1109/TEC.1959.5222754
Filename
5222754
Link To Document