Talk:Circuit complexity

history

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)

You mean $\Omega (2^{n}/n)$, I suppose.—Emil J. 15:16, 22 September 2010 (UTC)

Physical science

What you think of

41.113.186.43 (talk) 14:50, 20 July 2024 (UTC)

Chemistry

Simple circuits @Anele Ziyanda 41.113.186.43 (talk) 14:53, 20 July 2024 (UTC)