Talk:Circuit complexity

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Computer science Mid‑importance

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

Mid

This article has been rated as Mid-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Mathematics Mid‑priority

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Mid	This article has been rated as Mid-priority on the project's priority scale.

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)[reply]

You mean

\Omega (2^{n}/n)

, I suppose.—Emil J. 15:16, 22 September 2010 (UTC)[reply]

Size of unbounded-fan-in circuits

The size of circuits with unbounded fan-in is defined as the number of wires, not number of gates. See e. g. Reischuk, Karl Rüdiger (1990). Einführung in die Komplexitätstheorie. Hrsg.von Hans-Jürgen Appelrath u.a. Teubner or https://arxiv.org/abs/2204.06618 (page 801). 1802sanj0 (talk) 09:29, 23 May 2025 (UTC)[reply]