Circuit complexity: Difference between revisions

Revision as of 08:47, 25 May 2010

Revision as of 21:02, 14 June 2010

Line 17:

===Logspace uniform===

A family of Boolean circuitscircuitsrggdgsdjihsdfsdgtsdksduifm,v sogysrfgnsd8fysdklgserfhsdyaufzlndfh <math>\{C_n:n \in \mathbb{N}\}</math> is ''logspace uniform'' if there exists a [[deterministic Turing machine]] ''M'', such that

*''M'' runs in logarithmic space

* For all <math>n \in \mathbb{N}</math>, ''M'' outputs a description of <math>C_n</math> on input <math>1^n</math>