Revision as of 21:02, 14 June 2010 edit 205.201.255.5 (talk) →Uniformity ← Previous edit		Revision as of 21:58, 14 June 2010 edit undo RobinK (talk \| contribs) Extended confirmed users, Pending changes reviewers 3,059 edits m Reverted 1 edit by 205.201.255.5 identified as vandalism to last revision by 92.137.6.91. (TW) Next edit →
Line 17: ===Logspace uniform=== A family of Boolean ~~circuitsrggdgsdjihsdfsdgtsdksduifm,v sogysrfgnsd8fysdklgserfhsdyaufzlndfh~~circuits <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>

Circuit complexity: Difference between revisions