Advertisement

Circuit-size complexity

Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 211)

Keywords

Boolean Function Turing Machine Binary Encode Polynomial Size Boolean Circuit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Personalised recommendations