Scribd
Upload
17 views

Not A One-Way Function

This document outlines an end semester examination for a course on computational complexity. It consists of 11 problems worth a total of 50 points to be completed in 3 hours. The problems cover NP-easy, NP-complete, and NP-hard complexity classes. Students are asked to prove certain languages are in specific complexity classes, show closure properties, and reduce problems to known complete problems. The final problem asks students to write a less than 200 word feedback on the course.

Uploaded by

gowthamkurri
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
17 views

Not A One-Way Function

This document outlines an end semester examination for a course on computational complexity. It consists of 11 problems worth a total of 50 points to be completed in 3 hours. The problems cover NP-easy, NP-complete, and NP-hard complexity classes. Students are asked to prove certain languages are in specific complexity classes, show closure properties, and reduce problems to known complete problems. The final problem asks students to write a less than 200 word feedback on the course.

Uploaded by

gowthamkurri
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

End Semester Examination, Autumn 2003-04

Total points: 50

April 25, 2004

Total time: 3 hours

[Solve four NP-easy, four NP-complete and the NP-hard problems. Each problem carries six points.]
NP-Easy problems
1. Prove that the language {0m 1k | m has a divisor d with 2 6 d 6 k} is in P.
2. Show that each NC j is closed under complementation.
3. Let f : be a function with the property that f (f ()) = f () for every . Argue that f is
not a one-way function.
4. Suppose that NP 6= coNP. Show that there exist languages A and B such that A is not poly-time reducible
to B and B is not poly-time reducible to A.
5. Design an NC2 circuit to compute the product of two n-bit unsigned integers given in binary representation.
NP-Complete problems
(View the hints as certificates)
6. Prove that TIME(n) 6= NL. (Hint: Suppose that TIME(n) = NL. Then use padding (cf. Exercise 2.3.4)
to show that TIME(n2 ) NL.)
7. Show that PP is closed under symmetric difference, i.e., if the languages L 1 and L2 (over the same alphabet)
are in PP, then so also is the language L1 4 L2 := (L1 \ L2 ) (L2 \ L1 ) = (L1 L2 ) \ (L1 L2 ).
8. Show that the language
THRESHOLD-SAT := {h, ki | is a Boolean formula with more than k satisfying assignments}
is PP-complete. (Hint: Assume that MAJSAT is PP-complete. To prove THRESHOLD-SAT PP,
first make a coin toss. If the outcome is Head, evaluate , otherwise forget and make some more coin
tosses.)
9. A NAND gate takes two input bits (call them x and y) and outputs the bit x y := x y = x y. Let us
call a Boolean circuit consisting only of NAND gates a NAND circuit. Show that the language
NAND-CIRCUIT-VALUE := {hC, i | C is a NAND circuit and C() = 1}
is P-complete. (Hint: Assume that CIRCUIT-VALUE is P-complete.)
10. Show that if there exists a bijective one-way function, then NP coNP 6= P. (Hint: For a one-way function
f look at the language Lf discussed in the proof of the theorem relating the existence of one-way functions
with the hypothesis that P 6= UP.)
NP-Hard problem
11. Write a short feedback about this course. Your essay may not exceed 200 words. Please avoid being unduly
praising or abusing, but comment on the relevance, coverage and effectiveness of the course and its teaching.

Dr. Abhijit Das, Dept. of Computer Science & Engg, Indian Institute of Technology, Kharagpur 721 302

You might also like