lecture10 - A CIRCUIT CSci 5403 COMPLEXITY THEORY LECTURE X...

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

View Full Document Right Arrow Icon
1 COMPLEXITY THEORY CSci 5403 LECTURE X: CIRCUIT LOWER BOUNDS A CIRCUIT Each node has a label 2 {x 1 ,…,x n , A , Ç , ¬ } ¬ x 0 x 1 x 2 A circuit C with n inputs and m outputs computes a function ƒ C : {0,1} n ! {0,1} m . Is a directed acyclic graph, where: Each node has in-degree either 0 (inputs), 1 ( ¬ ), or m ( A , Ç ) Nodes with out-degree 0 are the outputs of the circuit. Definition. A circuit family is a sequence of circuits C 1 , C 2 , C 3 , C 4 , … where for each n, C n has n inputs. We write the family as {C n } n 2 N . The language of a circuit family is the set L, where x 2 L , C |x| (x) = 1. The size of a circuit, |C|, is the number of gates. The size of a circuit family is the function s(n) = |C n | Definition. A language is in SIZE(t(n)) if it is decided by a circuit family of size O(t(n)). P/poly = c 2 N SIZE(n c ) Theorem. P ½ P/poly. Corollary. If NP * P/Poly, then P NP.
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 NONUNIFORM ALGORITHMS A Turing Machine with advice gets an additional
Background image of page 2
Image of page 3
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

lecture10 - A CIRCUIT CSci 5403 COMPLEXITY THEORY LECTURE X...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online