Math 2.0

Areas Theory of computation Topic

Boolean circuit complexity

Summary

This topic is a part of theory of computation. It covers Boolean circuits and formulas as a nonuniform model, the counting bounds, the lower bounds for restricted classes of circuits, and the parallel classes NC and AC.

About this page
TagQK29KC8S1K
URIm2://QK29KC8S1K
Kindtopic
WritingW0 stub
MSC68Q06, 68Q15, 68Q17
Part ofTheory of computation
Changed17 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a same_as or a source (0 of 1)
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd

What links here

No page links to this page yet.