Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

Paper:

TR07-045 | 24th April 2007 00:00

The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis

TR07-045
Authors: Heribert Vollmer
Publication: 16th May 2007 19:35