2006-12-11
Re: Does anyone have solution for HW5 question 2 and 3.
Originally Posted By: Ericenmiles@gmail.com
For question 2, you can use the same oracle set B from the proof given in class (11/29 slides) that there is an oracle which separates P from NP. In that proof, there was a language L given which is in NP^{B} but not in P^{B}. The language was L = {0^n | there is a string of length n in B}. We
'''Originally Posted By: Ericenmiles@gmail.com'''
For question 2, you can use the same oracle set B from the proof given in class (11/29 slides) that there is an oracle which separates P from NP. In that proof, there was a language L given which is in NP^{B} but not in P^{B}. The language was L = {0^n | there is a string of length n in B}. We
(c) 2025 Yioop - PHP Search Engine