This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Ted Kaminski CSci 5403 - Computational Complexity Homework 3 Problem 1 Solution 1 Problem statement Show that for every k > 0, PH contains languages whose circuit complexity is ( n k ). Hint: Recall that by the size hierarchy theorem, there exist languages with circuit complexity ( n k ). Write a PH sentence that ensures that a language is one of these. 2 Solution Recall the size hierarchy theorem, which states: For every T 1 , T 2 , with 2 n /n > T 1 ( n ) > 10 T 2 ( n ) > n , SIZE ( T 2 ( n )) SIZE ( T 1 ( n )). Our goal is to describe a language L k PH that, given some k , (deterministically) finds a unique circuit (guaranteed to exist by the above theorem) of minimum size n k , and evaluates the input on that circuit. We will, in fact, do this with a language that is in p 3 . The trick is relatively simple: we can use quantifiers to range over all possible circuits, and simply select one with the desired properties....
View Full 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.
- Spring '08