Loading jsMath...
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > SVETLANA ABLAYEVA:
All reports by Author Svetlana Ablayeva:

TR98-050 | 6th July 1998
Farid Ablayev, Svetlana Ablayeva

A Discrete Approximation and Communication Complexity Approach to the Superposition Problem

The superposition (or composition) problem is a problem of
representation of a function f by a superposition of "simpler" (in a
different meanings) set \Omega of functions. In terms of circuits
theory this means a possibility of computing f by a finite circuit
with 1 fan-out gates \Omega of functions. ... more >>>




ISSN 1433-8092 | Imprint