Jump to content

Talk:Circuit complexity

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

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]

Physical science

[edit]

What you think of



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

Chemistry

[edit]

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