1987•USSR Computational Mathematics and Mathematical PhysicsRequires access

On lower bounds for the complexity of disjunctive normal forms of Boolean functions with a small number of zeros

Alexander Kogan

Open publisher page 2 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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.

Key concepts: Disjunctive normal form, Parity function, Mathematics, Boolean function, Conjunctive normal form, Upper and lower bounds, Discrete mathematics, Combinatorics

Back to paper search Browse research topics Original source

On lower bounds for the complexity of disjunctive normal forms of Boolean functions with a small number of zeros — Research Paper | ScholarLens