Bounding the Complexity of Advice Functions

✍ Scribed by R. Gavalda

• Publisher: Elsevier Science
• Year: 1995
• Tongue: English
• Weight: 624 KB
• Volume: 50
• Category: Article
• ISSN: 0022-0000
• DOI: 10.1006/jcss.1995.1037

✦ Synopsis

It was known that every set (\boldsymbol{A}) in (P) poly has an advice function in (\operatorname{PF}\left(\Sigma_{2}^{p}(A)\right)). This paper shows that (A) also has an advice function in (\operatorname{PF}\left(\operatorname{NP}(A) \oplus \Sigma_{3}^{p}\right)). From this new bound, it is shown that separating (\Delta_{2}^{\mathrm{p}}) and (\Sigma_{2}^{\mathrm{o}}) relative to a set in (\mathrm{P} /) poly is as hard as obtaining the same separation, unrelativized. c 1995 Academic Press, Inc.