Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,190,745 papers from all fields of science
Search
Sign In
Create Free Account
Karnaugh map
Known as:
Karnaugh-Veitch map
, Karnaugh
, Map K
Expand
The Karnaugh map, also known as the K-map, is a method to simplify boolean algebra expressions. Maurice Karnaugh introduced it in 1953 as a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
24 relations
AND gate
Algorithm
Bitwise operation
Circuit minimization for Boolean functions
Expand
Broader (2)
Boolean algebra
Logic in computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Karnaugh-map like online embedding algorithm of wireless virtualization
Mao Yang
,
Yong Li
,
Lieguang Zeng
,
Depeng Jin
,
L. Su
International Symposium on Wireless Personal…
2012
Corpus ID: 20797682
Wireless virtualization enables multiple concurrent wireless networks running on a shared wireless substrate to support different…
Expand
2009
2009
Determining All Candidate Keys Based on Karnaugh Map
Yi-Shun Zhang
International Conference on Information…
2009
Corpus ID: 26956691
Determining all candidate keys is important step in designing relational database. Familiar algorithms are generally time…
Expand
2008
2008
KMVQL: a visual query interface based on Karnaugh map
J. Huo
International Working Conference on Advanced…
2008
Corpus ID: 7947889
Extracting information from data is an interactive process. Visualization plays an important role, particularly during data…
Expand
1999
1999
A Systematic Procedure for Designing State Combination Circuits in PLCs
Chien-Pen Chuang
,
Xing Lan
,
Joseph C. C. Chen
1999
Corpus ID: 63634262
1999
1999
Hardware/firmware co-design in an 8-bits microcontroller to solve the system-level ESD issue on keyboard
M. Ker
,
Yu-Yu Sung
Electrical Overstress/Electrostatic Discharge…
1999
Corpus ID: 25856220
1992
1992
Using Karnaugh maps to solve Boolean equations by successive elimination
J. Tucker
,
M. Tapia
Proceedings IEEE Southeastcon '92
1992
Corpus ID: 119684236
A novel Karnaugh map method for solving two-valued Boolean equations by successive elimination is presented. This method requires…
Expand
1987
1987
Identification and Modelling of Load Characteristics at High Frequencies
A. Morched
,
P. Kundur
IEEE Transactions on Power Systems
1987
Corpus ID: 34266257
A simple technique for identifying the high frequency characteristics of a load feeder is presented. The method is based on…
Expand
Highly Cited
1984
Highly Cited
1984
X-Ray Diffraction Study of Aqueous Montmorillonite Emulsions
Y. Fukushima
1984
Corpus ID: 52106594
An X-ray diffraction study of aqueous emulsions of a Na-montmorillonite shows that: (1) At low water content, the d-spacings of…
Expand
Highly Cited
1983
Highly Cited
1983
Symbolic Reliability Analysis with the Aid of Variable-Entered Karnaugh Maps
A. Rushdi
IEEE Transactions on Reliability
1983
Corpus ID: 20213950
A method for finding the symbolic reliability of a moderately complex system is presented. The method uses Bayesian decomposition…
Expand
1977
1977
Boolean differentiation and integration using Karnaugh maps
J. Tucker
,
M. Tapia
,
A. W. Bennett
1977
Corpus ID: 118766866
Algorithms are presented for differentiation and integration of Boolean functions by means of Karnaugh maps. The algorithms are…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required