### Citations

39 |
EXMIN: A Simplification Algorithm for Exclusive-OR-Sum-ofProducts Expressions for Multiple-Valued Input Two-Valued Output Functions
- Sasao
- 1990
(Show Context)
Citation Context ..., 13]. From a practical viewpoint, the problem of heuristic ESOP minimization seems more attractive and numerous heuristic ESOP minimizers have been proposed and gradually refined in the past decades =-=[4, 9, 10, 11]-=-. A comprehensive survey of previous work is presented in [4]. In this work, a single–output ESOP minimization algorithm is detailed. Given a boolean function f, an initial expression is generated for... |

37 | Fast Heuristic Minimization of Exclusive-Sums-of-Products
- Mishchenko, Perkowski
- 2001
(Show Context)
Citation Context ...an active research area, due to advantages ESOP expressions possess relative to sum– of–products (SOPs), such as excellent testability properties, and experimentally observed smaller expression sizes =-=[4]-=-. Moreover, for an n-variable boolean function, the upper bound in the number of product terms of ESOPs is 29 · 2 n−7 , n > 6 [2] as opposed to 2 n−1 for SOPs. The problem of exact ESOP minimization, ... |

31 | Minimization of exclusive sum of products expressions for multi-output multiple-valued input, incompletely specified functions
- Song, Perkowski
- 1996
(Show Context)
Citation Context ..., 13]. From a practical viewpoint, the problem of heuristic ESOP minimization seems more attractive and numerous heuristic ESOP minimizers have been proposed and gradually refined in the past decades =-=[4, 9, 10, 11]-=-. A comprehensive survey of previous work is presented in [4]. In this work, a single–output ESOP minimization algorithm is detailed. Given a boolean function f, an initial expression is generated for... |

14 |
An Algorithm to derive the minimum ESOP for 6-variable functions
- Gaidukov
- 2002
(Show Context)
Citation Context ...ility properties, and experimentally observed smaller expression sizes [4]. Moreover, for an n-variable boolean function, the upper bound in the number of product terms of ESOPs is 29 · 2 n−7 , n > 6 =-=[2]-=- as opposed to 2 n−1 for SOPs. The problem of exact ESOP minimization, interesting in its own respect, has not yet found an efficient solution for more than six variables in the general case [7, 8, 1,... |

9 | Minimization of modulo-2 sum of products - Papakonstantinou - 1979 |

9 |
Exact minimization of ESOP expressions with less than eight product terms
- Stergiou, Papakonstantinou
(Show Context)
Citation Context ...ing National Technical University of Athens Greece G. Papakonstantinou papakon@cslab.ece.ntua.gr for up to twenty variables, when the number of the product terms in the final expression is restricted =-=[8, 3, 12, 11, 13]-=-. From a practical viewpoint, the problem of heuristic ESOP minimization seems more attractive and numerous heuristic ESOP minimizers have been proposed and gradually refined in the past decades [4, 9... |

8 |
Minimization of ring-sum expansions of Boolean functions
- Bioul, Davio, et al.
- 1973
(Show Context)
Citation Context ...n > 6 [2] as opposed to 2 n−1 for SOPs. The problem of exact ESOP minimization, interesting in its own respect, has not yet found an efficient solution for more than six variables in the general case =-=[7, 8, 1, 5, 6]-=-, although there exist published works that provide results Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that cop... |

4 |
Minimal modulo-2 expressions of switching functions with five variables
- Papakonstantinou
- 1981
(Show Context)
Citation Context ...n > 6 [2] as opposed to 2 n−1 for SOPs. The problem of exact ESOP minimization, interesting in its own respect, has not yet found an efficient solution for more than six variables in the general case =-=[7, 8, 1, 5, 6]-=-, although there exist published works that provide results Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that cop... |

4 | An exact minimization of and-exor expressions using reduced covering functions
- Sasao
- 1993
(Show Context)
Citation Context ...n > 6 [2] as opposed to 2 n−1 for SOPs. The problem of exact ESOP minimization, interesting in its own respect, has not yet found an efficient solution for more than six variables in the general case =-=[7, 8, 1, 5, 6]-=-, although there exist published works that provide results Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that cop... |

3 |
Minimizing and-exor expressions of some benchmark functions
- Hirayama, Sato, et al.
- 2003
(Show Context)
Citation Context ...ing National Technical University of Athens Greece G. Papakonstantinou papakon@cslab.ece.ntua.gr for up to twenty variables, when the number of the product terms in the final expression is restricted =-=[8, 3, 12, 11, 13]-=-. From a practical viewpoint, the problem of heuristic ESOP minimization seems more attractive and numerous heuristic ESOP minimizers have been proposed and gradually refined in the past decades [4, 9... |

3 |
Towards a general novel exact esop minimization methodology
- Stergiou, Papakonstantinou
- 2003
(Show Context)
Citation Context ...ing National Technical University of Athens Greece G. Papakonstantinou papakon@cslab.ece.ntua.gr for up to twenty variables, when the number of the product terms in the final expression is restricted =-=[8, 3, 12, 11, 13]-=-. From a practical viewpoint, the problem of heuristic ESOP minimization seems more attractive and numerous heuristic ESOP minimizers have been proposed and gradually refined in the past decades [4, 9... |

2 |
An efficient algorithm for exact esop minimization
- Stergiou, Papakonstantinou
- 2002
(Show Context)
Citation Context |