Complexity of Boolean Functions Over Bases with Unbounded Fan-In Gates

Vlado DancĂ­k. Complexity of Boolean Functions Over Bases with Unbounded Fan-In Gates. Inf. Process. Lett., 57(1):31-34, 1996. [doi]

Abstract

Abstract is missing.