Approximable sets:
Gespeichert in:
| Beteiligte Personen: | , , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Amsterdam
1993
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
93,72 |
| Schlagwörter: | |
| 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." |
| Umfang: | 15 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010177791 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 950511s1993 xx |||| 00||| engod | ||
| 035 | |a (OCoLC)31639680 | ||
| 035 | |a (DE-599)BVBBV010177791 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Beigel, Richard |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Approximable sets |c R. Beigel ; M. Kummer ; F. Stephan |
| 264 | 1 | |a Amsterdam |c 1993 | |
| 300 | |a 15 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 93,72 | |
| 520 | 3 | |a 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." | |
| 650 | 4 | |a Set theory | |
| 700 | 1 | |a Kummer, Martin |e Verfasser |4 aut | |
| 700 | 1 | |a Stephan, Frank |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 93,72 |w (DE-604)BV008928356 |9 93,72 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006760282 | |
Datensatz im Suchindex
| _version_ | 1818952374958424064 |
|---|---|
| any_adam_object | |
| author | Beigel, Richard Kummer, Martin Stephan, Frank |
| author_facet | Beigel, Richard Kummer, Martin Stephan, Frank |
| author_role | aut aut aut |
| author_sort | Beigel, Richard |
| author_variant | r b rb m k mk f s fs |
| building | Verbundindex |
| bvnumber | BV010177791 |
| ctrlnum | (OCoLC)31639680 (DE-599)BVBBV010177791 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01752nam a2200301 cb4500</leader><controlfield tag="001">BV010177791</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">950511s1993 xx |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31639680</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010177791</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Beigel, Richard</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximable sets</subfield><subfield code="c">R. Beigel ; M. Kummer ; F. Stephan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">15 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">93,72</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">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."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Set theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kummer, Martin</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Stephan, Frank</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">93,72</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">93,72</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006760282</subfield></datafield></record></collection> |
| id | DE-604.BV010177791 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:49:22Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006760282 |
| oclc_num | 31639680 |
| open_access_boolean | |
| physical | 15 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Beigel, Richard Verfasser aut Approximable sets R. Beigel ; M. Kummer ; F. Stephan Amsterdam 1993 15 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 93,72 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." Set theory Kummer, Martin Verfasser aut Stephan, Frank Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 93,72 (DE-604)BV008928356 93,72 |
| spellingShingle | Beigel, Richard Kummer, Martin Stephan, Frank Approximable sets Set theory |
| title | Approximable sets |
| title_auth | Approximable sets |
| title_exact_search | Approximable sets |
| title_full | Approximable sets R. Beigel ; M. Kummer ; F. Stephan |
| title_fullStr | Approximable sets R. Beigel ; M. Kummer ; F. Stephan |
| title_full_unstemmed | Approximable sets R. Beigel ; M. Kummer ; F. Stephan |
| title_short | Approximable sets |
| title_sort | approximable sets |
| topic | Set theory |
| topic_facet | Set theory |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT beigelrichard approximablesets AT kummermartin approximablesets AT stephanfrank approximablesets |