How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
AC0, NC1, and NC under a stated uniformity convention
Definition
All families in this definition are logspace-uniform. For bounded-fan-in families this means exactly the query interface of A logspace-uniform Boolean circuit family. For an unbounded-fan-in gate, the same interface is extended by a fan-in query and by predecessor queries that return the -th predecessor of gate (or report that is out of range); the transducer must answer all such queries in logarithmic space.
has polynomial size, constant depth, unbounded-fan-in AND/OR, and NOT gates. has polynomial size, bounded fan-in, and logarithmic depth. is the union of polynomial-size bounded-fan-in families of polylogarithmic depth. This convention does not constrain arbitrary families.
Depends on
Used by
- NC1 is contained in L, and L is contained in NC2 Proposition
Dependency tree · two levels
3 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Arora and Barak, Computational Complexity: A Modern Approach (standard reference, not scraped)
- Lance Fortnow, Counting Complexity (standard reference, not scraped)