lecture25

# lecture25 - Bounds on circuit computation so far: CSci 5403...

This preview shows pages 1–3. Sign up to view the full content.

1 COMPLEXITY THEORY CSci 5403 LECTURE XXV: CIRCUIT LOWER BOUNDS “Bounds” on circuit computation so far: Size Hierarchy Theorem: For every ƒ(n) = o(2 n /n) there exists a function with complexity ω (ƒ(n)) Shannon bounds: “most” functions have complexity Θ (2 n /n) Relationships to uniform classes ( ˲ k, PH languages in SIZE( Θ (n k )), X ˧ P/poly ˰ Amazing(X), BPP ˧ P/poly, NC 1 ˧ L ˧ NL ˧ NC 2 …) This week: concrete bounds, specific languages. Theorem. Define (x 1 ,…,x n ) = i x i mod 2. Then any constant-depth circuit family for (with unbounded fan-in/out ( ˭ , ˮ ,¬ gates) has exponential size. Corollary. AC 0 . Proposition. ˥ NC 1 . Corollary. AC 0 NC 1 . Exponential lower bounds! For a simple function! Idea. A constant-depth ( ˭ , ˮ ,¬) poly(n)-size circuit can be set to a constant by fixing “few” input bits: ˭ ˮ ˮ ˮ But fixing even n-1 bits of the input to does not make the function constant!

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2 Definition. A restriction ρ ˥ {0,1,*} n of function ƒ : {0,1} n {0,1} is the function given by ρ (x) i = ρ i , if ρ i {0,1} x i , if ρ i = * We let ƒ| ρ denote the map x ƒ( ρ (x)) Proposition. | ρ
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 10/21/2011 for the course CSCI 5403 taught by Professor Sturtivant,c during the Spring '08 term at Minnesota.

### Page1 / 4

lecture25 - Bounds on circuit computation so far: CSci 5403...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online