Skip to search formSkip to main contentSkip to account menu

Karnaugh map

Known as: Karnaugh-Veitch map, Karnaugh, Map K 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

24 relations
AND gateAlgorithmBitwise operationCircuit minimization for Boolean functions

Broader (2)

Boolean algebraLogic 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
Wireless virtualization enables multiple concurrent wireless networks running on a shared wireless substrate to support different… 
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… 
2008
2008
KMVQL: a visual query interface based on Karnaugh map
Extracting information from data is an interactive process. Visualization plays an important role, particularly during data… 
1999
1999
A Systematic Procedure for Designing State Combination Circuits in PLCs
1995
1995
Contiguous and Non-Contiguous Processor Allocation Algorithms for kappa-cubes
A lunch box incorporates a radio which is positioned on a side surface and held in position by means of a flexible bracket. A… 
1992
1992
Using Karnaugh maps to solve Boolean equations by successive elimination
A novel Karnaugh map method for solving two-valued Boolean equations by successive elimination is presented. This method requires… 
1991
1991
Rational Functions, Labelled Configurations, and Hilbert Schemes
In this paper, we continue the study of the homotopy type of spaces of rational functions from S to CP begun in [3,4]. We prove… 
1987
1987
Identification and Modelling of Load Characteristics at High Frequencies
A simple technique for identifying the high frequency characteristics of a load feeder is presented. The method is based on… 
1971
1971
A nonsmoothable knot
In this note we prove the existence of a locally flat topological embedding of 5 in S, which is not equivalent to a smooth… 
1968
1968
Application of Karnaugh maps to Maitra cascades
  • G. Fantauzzi
  • AFIPS Spring Joint Computing Conference
  • 1968
  • Corpus ID: 36517031
A Maitra cascade, as shown in Fig. 8, is a one dimensional cellular array whose cells have only one output and two inputs. At the… 
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)