Skip to main content
Book Chapter

The Complexity of Boolean Functions

Springer-Verlag, (2005), 251-275
DOI: 10.1007/3-540-27477-4_16
N/ACitations
Citations of this article
110Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Horn complexity as the minimum length of a Horn formula for a function.

Cite

CITATION STYLE

APA

The Complexity of Boolean Functions. (2005). In Complexity Theory (pp. 251–275). Springer-Verlag. https://doi.org/10.1007/3-540-27477-4_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free