Advertisement

A Complexity Problem

Chapter
  • 393 Downloads

Abstract

Combinatorial extremal problems involving more than one operation are usually very difficult. Complexity problems fall into this category. We propose here an approach to the construction of monotone Boolean functions of large formula size (and large combinational complexity) via the following extremal problem, which involves only one operation.

Copyright information

© Springer-Verlag New York Inc. 1987

Authors and Affiliations

  1. 1.Universität BielefeldBielefeld 1Germany

Personalised recommendations