skip to content
Approximable sets Preview this item
ClosePreview this item
Checking...

Approximable sets

Author: Richard Beigel; Martin Kummer; Frank Stephan
Publisher: Amsterdam, the Netherlands : Centrum voor Wiskunde en Informatica, [1993]
Series: Report (Centrum voor Wiskunde en Informatica (Amsterdam, Netherlands). Computer Science/Dept. of Algorithmics and Architecture, CS-R9372.
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
Summary:
Abstract: "Much structural work on NP-complete sets has exploited SAT's d-self-reducibility. In this paper we exploit the additional fact that SAT is a d-cylinder to show that NP-complete sets are p-superterse unless P = NP. In fact, every set that is NP-hard under polynomial-time n[superscript o(1)]-tt reductions is p-superterse unless P = NP. In particular no p-selective set is NP-hard under polynomial-time  Read more...
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; Martin Kummer; Frank Stephan
OCLC Number: 31639680
Notes: "December 1993."
Description: 15 pages ; 29 cm.
Series Title: Report (Centrum voor Wiskunde en Informatica (Amsterdam, Netherlands). Computer Science/Dept. of Algorithmics and Architecture, CS-R9372.
Responsibility: R. Beigel, M. Kummer, F. Stephan.

Abstract:

Abstract: "Much structural work on NP-complete sets has exploited SAT's d-self-reducibility. In this paper we exploit the additional fact that SAT is a d-cylinder to show that NP-complete sets are p-superterse unless P = NP. In fact, every set that is NP-hard under polynomial-time n[superscript o(1)]-tt reductions is p-superterse unless P = NP. In particular no p-selective set is NP-hard under polynomial-time n[superscript o(1)]-tt reductions unless P = NP. In addition, no easily countable set is NP-hard under Turing reductions unless P = NP. Self- reducibility does not seem to suffice for our main result: in a relativized world, we construct a d-self-reducible set in NP - P that is polynomial- time 2-tt reducible to a p-selective set."

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/31639680> # Approximable sets
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "31639680" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/ne> ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/475660176#Place/amsterdam_the_netherlands> ; # Amsterdam, the Netherlands
    schema:about <http://id.worldcat.org/fast/1113587> ; # Set theory
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://viaf.org/viaf/306188271> ; # Martin Kummer
    schema:contributor <http://viaf.org/viaf/73377416> ; # Frank Christian Stephan
    schema:creator <http://viaf.org/viaf/280822699> ; # Richard Beigel
    schema:datePublished "1993" ;
    schema:description "Abstract: "Much structural work on NP-complete sets has exploited SAT's d-self-reducibility. In this paper we exploit the additional fact that SAT is a d-cylinder to show that NP-complete sets are p-superterse unless P = NP. In fact, every set that is NP-hard under polynomial-time n[superscript o(1)]-tt reductions is p-superterse unless P = NP. In particular no p-selective set is NP-hard under polynomial-time n[superscript o(1)]-tt reductions unless P = NP. In addition, no easily countable set is NP-hard under Turing reductions unless P = NP. Self- reducibility does not seem to suffice for our main result: in a relativized world, we construct a d-self-reducible set in NP - P that is polynomial- time 2-tt reducible to a p-selective set.""@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/475660176> ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://worldcat.org/issn/0169-118X> ; # Report = Rapport / Centrum voor Wiskunde en Informatica. Computer Science/Dept. of Algorithmics and Architecture,
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/475660176#Series/report_centrum_voor_wiskunde_en_informatica_amsterdam_netherlands_computer_science_dept_of_algorithmics_and_architecture> ; # Report (Centrum voor Wiskunde en Informatica (Amsterdam, Netherlands). Computer Science/Dept. of Algorithmics and Architecture ;
    schema:name "Approximable sets"@en ;
    schema:productID "31639680" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/31639680#PublicationEvent/amsterdam_the_netherlands_centrum_voor_wiskunde_en_informatica_1993> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/475660176#Agent/centrum_voor_wiskunde_en_informatica> ; # Centrum voor Wiskunde en Informatica
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/31639680> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/475660176#Agent/centrum_voor_wiskunde_en_informatica> # Centrum voor Wiskunde en Informatica
    a bgn:Agent ;
    schema:name "Centrum voor Wiskunde en Informatica" ;
    .

<http://experiment.worldcat.org/entity/work/data/475660176#Place/amsterdam_the_netherlands> # Amsterdam, the Netherlands
    a schema:Place ;
    schema:name "Amsterdam, the Netherlands" ;
    .

<http://experiment.worldcat.org/entity/work/data/475660176#Series/report_centrum_voor_wiskunde_en_informatica_amsterdam_netherlands_computer_science_dept_of_algorithmics_and_architecture> # Report (Centrum voor Wiskunde en Informatica (Amsterdam, Netherlands). Computer Science/Dept. of Algorithmics and Architecture ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/31639680> ; # Approximable sets
    schema:name "Report (Centrum voor Wiskunde en Informatica (Amsterdam, Netherlands). Computer Science/Dept. of Algorithmics and Architecture ;" ;
    .

<http://id.worldcat.org/fast/1113587> # Set theory
    a schema:Intangible ;
    schema:name "Set theory"@en ;
    .

<http://viaf.org/viaf/280822699> # Richard Beigel
    a schema:Person ;
    schema:familyName "Beigel" ;
    schema:givenName "Richard" ;
    schema:name "Richard Beigel" ;
    .

<http://viaf.org/viaf/306188271> # Martin Kummer
    a schema:Person ;
    schema:familyName "Kummer" ;
    schema:givenName "Martin" ;
    schema:name "Martin Kummer" ;
    .

<http://viaf.org/viaf/73377416> # Frank Christian Stephan
    a schema:Person ;
    schema:familyName "Stephan" ;
    schema:givenName "Frank Christian" ;
    schema:givenName "Frank" ;
    schema:name "Frank Christian Stephan" ;
    .

<http://worldcat.org/issn/0169-118X> # Report = Rapport / Centrum voor Wiskunde en Informatica. Computer Science/Dept. of Algorithmics and Architecture,
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/31639680> ; # Approximable sets
    schema:issn "0169-118X" ;
    schema:name "Report = Rapport / Centrum voor Wiskunde en Informatica. Computer Science/Dept. of Algorithmics and Architecture," ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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