Minimizing AND-EXOR expressions for multiple-valued two-input logic functions

Takaaki Mizuki, Hitoshi Tsubata, Takao Nishizeki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A minimum ESOP (Exclusive-OR Sum-of-Products) form of a logic function f is an AND-EXOR 2-level expression of f having the minimum number of product terms. In the paper we deal with multiplevalued 2-input logic functions f, and give an algorithm to find a minimum ESOP form of a given function f in polynomial time.

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - 6th Annual Conference, TAMC 2009, Proceedings
Pages301-310
Number of pages10
DOIs
Publication statusPublished - 2009 Jul 16
Event6th Annual Conference on Theory and Applications of Models of Computation, TAMC 2009 - Changsha, China
Duration: 2009 May 182009 May 22

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5532 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other6th Annual Conference on Theory and Applications of Models of Computation, TAMC 2009
CountryChina
CityChangsha
Period09/5/1809/5/22

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Minimizing AND-EXOR expressions for multiple-valued two-input logic functions'. Together they form a unique fingerprint.

Cite this