z-logo
open-access-imgOpen Access
A Literal Code Method For Minimizing Boolean Functions
Author(s) -
Hidekatsu Miyakoshi
Publication year - 1990
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/33.4.375
Subject(s) - literal (mathematical logic) , boolean function , computer science , product term , boolean data type , boolean expression , conjunctive normal form , algebraic number , theoretical computer science , algorithm , code (set theory) , arithmetic , algebra over a field , mathematics , programming language , two element boolean algebra , set (abstract data type) , mathematical analysis , pure mathematics , filtered algebra

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom