CS 2401 – Introduction to Complexity Theory

Pitassi, T. (2015). CS 2401 – Introduction to Complexity Theory.

Type

Unclassified

Intellectual base

Unclassified

Year

2015

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• AC (complexity)
  • For example, the distinction between constitutive identity and a convenient observable transfers from An AC^0 family computes an unbounded OR in constant depth and polynomial size. to A bounded-depth database query implementation is classified only after its circuit family and uniformity are specified..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:f39377261e78 · see in the full table