Talk:Circuit complexity

Latest comment: 13 years ago by EmilJ in topic history

history edit

I thought this started with Shannon's theorem that a random Boolean function on n variables takes O(2^n) gates. 66.127.54.226 (talk) 18:14, 21 September 2010 (UTC)Reply

You mean  , I suppose.—Emil J. 15:16, 22 September 2010 (UTC)Reply