Local complexity of Boolean functions

0Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.

Abstract

Classes of locally complex and locally simple functions are introduced. The classes are proved to be invariant with respect to polynomially equivalent complexity measures. A relationship is considered between proving that a function belongs to a class of locally complex functions and proving lower bounds for Boolean circuits, switching circuits, formulas, and π-circuits (formulas over the basis {&,∨,-}). © 2002 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Chashkin, A. V. (2004). Local complexity of Boolean functions. Discrete Applied Mathematics, 135(1–3), 55–64. https://doi.org/10.1016/S0166-218X(02)00294-9

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