Publication result detail

A Method for Finding All Disjoint Covers of a Boolean Function

EYSSELT, M.

Original Title

A Method for Finding All Disjoint Covers of a Boolean Function

English Title

A Method for Finding All Disjoint Covers of a Boolean Function

Type

Paper in proceedings outside WoS and Scopus

Original Abstract

This paper presents the design of an original algebraic method which is able to find all disjoint covers of vertices of a Boolean function, and in this way to get correspondent expressions of a Boolean function in the standard form, i.e. in a sum-of-products or in a product-of-sums.

English abstract

This paper presents the design of an original algebraic method which is able to find all disjoint covers of vertices of a Boolean function, and in this way to get correspondent expressions of a Boolean function in the standard form, i.e. in a sum-of-products or in a product-of-sums.

Keywords

disjoint cover of a Boolean function, cover function, Petrick's method

Key words in English

disjoint cover of a Boolean function, cover function, Petrick's method

Authors

EYSSELT, M.

Released

01.01.1995

Publisher

Faculty of Electrical Engineering and Computer Science BUT

Location

June 28, Brno

Book

Proceedings of the Electronic Devices and Systems Conference

Pages from

209

Pages to

212

Pages count

4

BibTex

@inproceedings{BUT192225,
  author="Miloš {Eysselt}",
  title="A Method for Finding All Disjoint Covers of a Boolean Function",
  booktitle="Proceedings of the Electronic Devices and Systems Conference",
  year="1995",
  pages="209--212",
  publisher="Faculty of Electrical Engineering and Computer Science BUT",
  address="June 28, Brno"
}