The effect of basis on size of Boolean expressions

  • Authors:

  • V. R. Pratt

  • Affiliations:

  • -

  • Venue:
  • SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
  • Year:
  • 1975

Quantified Score

Hi-index 0.00

Visualization

Abstract

To within a constant factor, only two complexity classes of complete binary bases exist. We show that they are separated by at most O(nlog310), or about O(n2.095), complementing a result of Khrapchenko that establishes an order n2 lower bound.