skip to content
A relationship between difference hierarchies and relativized polynomial hierarchies Preview this item
ClosePreview this item
Checking...

A relationship between difference hierarchies and relativized polynomial hierarchies

Author: Richard Beigel; Richard Chang; Mitsunori Ogiwara
Publisher: Ithaca, N.Y. : Cornell University, Dept. of Computer Science, [1991]
Series: Cornell University.; Department of Computer Science.; Technical report
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
Summary:
Chang and Kadin have shown that if the difference hierarchy over NP collapses to level $k$, then the polynomial hierarchy (PH) is equal to the $k$th level of the difference hierarchy over $\Sigma_{2}[superscript]{p}$. We simplify their proof and obtain a slightly stronger conclusion: If the difference hierarchy over NP collapses to level $k$, then PH = $\left(P_{(k-1)-tt}[superscript]{NP}\right)[supers cript]{NP}$.
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Richard Beigel; Richard Chang; Mitsunori Ogiwara
OCLC Number: 25776302
Notes: "January 1991."
Description: 17 pages ; 28 cm.
Series Title: Cornell University.; Department of Computer Science.; Technical report
Responsibility: Richard Beigel, Richard Chang, Mitsunori Ogiwara.

Abstract:

Chang and Kadin have shown that if the difference hierarchy over NP collapses to level $k$, then the polynomial hierarchy (PH) is equal to the $k$th level of the difference hierarchy over $\Sigma_{2}[superscript]{p}$. We simplify their proof and obtain a slightly stronger conclusion: If the difference hierarchy over NP collapses to level $k$, then PH = $\left(P_{(k-1)-tt}[superscript]{NP}\right)[supers cript]{NP}$. We also extend the result to classes other than NP: For any class $C$ that has $\leq_{m}[superscript]{p}$-complete sets and is closed under $\leq_{conj}[superscript]{p}$- and $\leq_{m}[superscript]{NP}$-reductions, if the difference hierarchy over $C$ collapses to level $k$, then $PH[superscript]{C} = $\left(P_{(k-1)-tt}[superscript]{NP}\right)[supers cript]{C}$. Then we show that the exact counting class $C_{=}P$ is closed under $\leq_{disj}[superscript]{p}$- and $\leq_{m}[superscript]{co-NP}$-reductions. Consequently, if the difference hierarchy over $C_{=}P$ collapses to level $k$ then $PH[superscript]{PP}$ is equal to $\left(P_{(k-1)-tt}[superscript]{NP}\right)[supers cript]{PP}$. In contrast, the difference hierarchy over the closely related class PP is known to collapse.

Finally, we consider two ways of relativizing the bounded query class $P_{k-tt}[superscript]{NP}$: the restricted relativization $P_{k-tt}[superscript]{NP[superscript]{C}}$, and the full relativization $\left(P_{k-tt}[superscript]{NP}\right)[superscrip t]{C}$. If $C$ is NP-hard, then we show that the two relativizations are different unless $PH[superscript]{C}$ collapses.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/25776302> # A relationship between difference hierarchies and relativized polynomial hierarchies
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "25776302" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/28675066#Place/ithaca_n_y> ; # Ithaca, N.Y.
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nyu> ;
   schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://viaf.org/viaf/119395964> ; # Mitsunori Ogiwara
   schema:contributor <http://experiment.worldcat.org/entity/work/data/28675066#Person/chang_richard> ; # Richard Chang
   schema:creator <http://experiment.worldcat.org/entity/work/data/28675066#Person/beigel_richard> ; # Richard Beigel
   schema:datePublished "1991" ;
   schema:description "Chang and Kadin have shown that if the difference hierarchy over NP collapses to level $k$, then the polynomial hierarchy (PH) is equal to the $k$th level of the difference hierarchy over $\Sigma_{2}[superscript]{p}$. We simplify their proof and obtain a slightly stronger conclusion: If the difference hierarchy over NP collapses to level $k$, then PH = $\left(P_{(k-1)-tt}[superscript]{NP}\right)[supers cript]{NP}$. We also extend the result to classes other than NP: For any class $C$ that has $\leq_{m}[superscript]{p}$-complete sets and is closed under $\leq_{conj}[superscript]{p}$- and $\leq_{m}[superscript]{NP}$-reductions, if the difference hierarchy over $C$ collapses to level $k$, then $PH[superscript]{C} = $\left(P_{(k-1)-tt}[superscript]{NP}\right)[supers cript]{C}$. Then we show that the exact counting class $C_{=}P$ is closed under $\leq_{disj}[superscript]{p}$- and $\leq_{m}[superscript]{co-NP}$-reductions. Consequently, if the difference hierarchy over $C_{=}P$ collapses to level $k$ then $PH[superscript]{PP}$ is equal to $\left(P_{(k-1)-tt}[superscript]{NP}\right)[supers cript]{PP}$. In contrast, the difference hierarchy over the closely related class PP is known to collapse."@en ;
   schema:description "Finally, we consider two ways of relativizing the bounded query class $P_{k-tt}[superscript]{NP}$: the restricted relativization $P_{k-tt}[superscript]{NP[superscript]{C}}$, and the full relativization $\left(P_{k-tt}[superscript]{NP}\right)[superscrip t]{C}$. If $C$ is NP-hard, then we show that the two relativizations are different unless $PH[superscript]{C}$ collapses."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/28675066> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/28675066#Series/technical_report> ; # Technical report ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/28675066#Series/technical_report_cornell_university_dept_of_computer_science> ; # Technical report. Cornell University. Dept. of Computer Science ;
   schema:name "A relationship between difference hierarchies and relativized polynomial hierarchies"@en ;
   schema:productID "25776302" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/25776302#PublicationEvent/ithaca_n_y_cornell_university_dept_of_computer_science_1991> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/28675066#Agent/cornell_university_dept_of_computer_science> ; # Cornell University, Dept. of Computer Science
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/25776302> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/28675066#Agent/cornell_university_dept_of_computer_science> # Cornell University, Dept. of Computer Science
    a bgn:Agent ;
   schema:name "Cornell University, Dept. of Computer Science" ;
    .

<http://experiment.worldcat.org/entity/work/data/28675066#Organization/cornell_university_department_of_computer_science> # Cornell University. Department of Computer Science.
    a schema:Organization ;
   schema:name "Cornell University. Department of Computer Science." ;
    .

<http://experiment.worldcat.org/entity/work/data/28675066#Person/beigel_richard> # Richard Beigel
    a schema:Person ;
   schema:familyName "Beigel" ;
   schema:givenName "Richard" ;
   schema:name "Richard Beigel" ;
    .

<http://experiment.worldcat.org/entity/work/data/28675066#Person/chang_richard> # Richard Chang
    a schema:Person ;
   schema:familyName "Chang" ;
   schema:givenName "Richard" ;
   schema:name "Richard Chang" ;
    .

<http://experiment.worldcat.org/entity/work/data/28675066#Series/technical_report> # Technical report ;
    a bgn:PublicationSeries ;
   schema:creator <http://experiment.worldcat.org/entity/work/data/28675066#Organization/cornell_university_department_of_computer_science> ; # Cornell University. Department of Computer Science.
   schema:hasPart <http://www.worldcat.org/oclc/25776302> ; # A relationship between difference hierarchies and relativized polynomial hierarchies
   schema:name "Technical report ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/28675066#Series/technical_report_cornell_university_dept_of_computer_science> # Technical report. Cornell University. Dept. of Computer Science ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/25776302> ; # A relationship between difference hierarchies and relativized polynomial hierarchies
   schema:name "Technical report. Cornell University. Dept. of Computer Science ;" ;
    .

<http://id.worldcat.org/fast/871991> # Computational complexity
    a schema:Intangible ;
   schema:name "Computational complexity"@en ;
    .

<http://viaf.org/viaf/119395964> # Mitsunori Ogiwara
    a schema:Person ;
   schema:familyName "Ogiwara" ;
   schema:givenName "Mitsunori" ;
   schema:name "Mitsunori Ogiwara" ;
    .

<http://www.worldcat.org/title/-/oclc/25776302>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
   schema:about <http://www.worldcat.org/oclc/25776302> ; # A relationship between difference hierarchies and relativized polynomial hierarchies
   schema:dateModified "2016-05-09" ;
   void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.