A C-version of minimal Boolean sum-of-product forms

DOI10.1016/0096-3003(92)90039-4zbMath0743.94025OpenAlexW2044057609MaRDI QIDQ1184805

Arun K. Mitra

Publication date: 28 June 1992

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(92)90039-4

zbMATH Keywords

symbolic computationminimal sums for a Boolean sum-of-product form

Mathematics Subject Classification ID

Boolean functions (06E30) Software, source code, etc. for problems pertaining to ordered structures (06-04) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Related Items (1)

A massive parallel computation in Boolean logic

Cites Work

• Minimal Boolean sum-of-product forms in PROLOG
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A C-version of minimal Boolean sum-of-product forms