Your download is now in progress and you may close this window

Did you know that with a free Taylor & Francis Online account you can gain access to the following benefits?

Choose new content alerts to be informed about new research of interest to you
Easy remote access to your institution's subscriptions on any device, from any location
Save your searches and schedule alerts to send you new results
Export your search results into a .csv file to support your research

Have an account?
Login now Don't have an account?
Register for free

Login or register to access this feature

Have an account?
Login now Don't have an account?
Register for free

Choose new content alerts to be informed about new research of interest to you
Easy remote access to your institution's subscriptions on any device, from any location
Save your searches and schedule alerts to send you new results
Export your search results into a .csv file to support your research

Search in:

Advanced search

IETE Journal of Research Volume 23, 1977 - Issue 9

Submit an article Journal homepage

Views

CrossRef citations to date

Altmetric

Original Articles

On Simplification of Boolean Functions

Debidas GhoshComputer Maintenance Corporation Ltd., New Delhi.

Pages 549-553 | Received 20 Dec 1976, Published online: 10 Jul 2015

Cite this article
https://doi.org/10.1080/03772063.1977.11451444

References
Citations
Metrics
Reprints & Permissions

REFERENCES

Quine (W V). The Problem of Simplifying Truth Funtions. Amer. Maths. Mon. 62, 1955; 521–531.
Google Scholar
McCLuskey (E J). Minimization of Boolean Functions. BSTJ. 35, 6; 1956; 1417–1444.
Google Scholar
Hwa (HR). A Method of Generating Prime Implicants of a Boolean Expression. IEEE Trans. C-23, 6; 1974; 637–641.
Web of Science ®Google Scholar
Schienmann (A H). A Method for Simplifying Boolean Functions. BSTJ. 41, 1962; 1337–1346.
Google Scholar
Suresh Chandra. Minimization of Boolean Expressions. Fifth Hwaii Intl. Conf. On System Sciences. Jan. 1972.
Google Scholar
Das (S R) and Chaudhury (A K). Maxterm Type Exp ressions of Switching Funtions and Their Prime Implicants. IEEE Trans. EC-14, 1965; 920–923.
Google Scholar
Marcus (MP). Switching Circuits for Engineers. 1969. Prentice-Hall Inc. P 71–92.
Google Scholar
Kohavi (Z). Switching and Finite Automata Theory. 1970. Tata McGraw-Hill, Inc. P 90–101.
Google Scholar

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Share icon
Back to Top

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.

People also read
Recommended articles
Cited by

To cite this article:

Reference style: APA Chicago Harvard

Citation copied to clipboard

Reference styles above use APA (6th edition), Chicago (16th edition) & Harvard (10th edition)

Download citation

Download a citation file in RIS format that can be imported by citation management software including EndNote, ProCite, RefWorks and Reference Manager.

Choose format: RIS BibTex RefWorks Direct Export

Choose options: Citation Citation & abstract Citation & references