ScholarLens Back to search
1994•Unpublished venueRequires access

An improved algorithm for Boolean factoring

Giuseppe Caruso

Open publisher page 0 citations

Abstract

This paper is concerned with an algorithm for Boolean factoring. In an earlier paper [1993], the author proposed a new algorithm for Boolean factoring that does not require any minimization step. The technique used for generating Boolean products rests on the notion of elementary rectangle. In this paper, we present two substantial improvements to this algorithm. The first is a new factoring strategy. The second is a new expansion technique. The modified algorithm outperforms the original one both in efficiency and quality of results.>

About this research paper

What this paper is about

This paper is concerned with an algorithm for Boolean factoring. In an earlier paper [1993], the author proposed a new algorithm for Boolean factoring that does not require any minimization step. The technique used for generating Boolean products rests on the notion of elementary rectangle. In this paper, we present two substantial improvements to this algorithm. The first is a new factoring strategy. The second is a new expansion technique. The modified algorithm outperforms the original one both in efficiency and quality of results.>

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper is concerned with an algorithm for Boolean factoring. In an earlier paper [1993], the author proposed a new algorithm for Boolean factoring that does not require any minimization step. The technique used for generating Boolean products rests on the notion of elementary rectangle. In this paper, we present two substantial improvements to this algorithm. The first is a new factoring strategy. The second is a new expansion technique. The modified algorithm outperforms the original one both in efficiency and quality of results.>

Key concepts: Factoring, Computer science, Circuit minimization for Boolean functions, Algorithm, Minification, Rectangle, Boolean expression, Quality (philosophy)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An improved algorithm for Boolean factoring — Research Paper | ScholarLens