On sparse oracles separating feasible complexity classes:
This note clarifies which oracles separate NP from P and which do not. In essence, we are changing our research paradigm from the study of which problems can be relativized in two conflicting ways to the study and characterization of the class of oracles achieving a specified relativization. Results...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, New York
1985
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
707 |
| Schlagworte: | |
| Zusammenfassung: | This note clarifies which oracles separate NP from P and which do not. In essence, we are changing our research paradigm from the study of which problems can be relativized in two conflicting ways to the study and characterization of the class of oracles achieving a specified relativization. Results of this type have the potential to yield deeper insights into the nature of relativization problems and focus our attention on new and interesting classes of languages A complete and transparent characterization of oracles that separate NP from P would resolve the long-standing P =? NP question. In this note, we settle a central case. We fully characterize the sparse oracles separating NP from P in worlds where P = NP. We display related results about coNP, E, NE, coNE, and PSPACE |
| Beschreibung: | 16 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010589741 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960130s1985 |||| 00||| engod | ||
| 035 | |a (OCoLC)16474586 | ||
| 035 | |a (DE-599)BVBBV010589741 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Hartmanis, Juris |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On sparse oracles separating feasible complexity classes |c Juris Hartmanis ; Lane Hemachandra |
| 264 | 1 | |a Ithaca, New York |c 1985 | |
| 300 | |a 16 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 707 | |
| 520 | 3 | |a This note clarifies which oracles separate NP from P and which do not. In essence, we are changing our research paradigm from the study of which problems can be relativized in two conflicting ways to the study and characterization of the class of oracles achieving a specified relativization. Results of this type have the potential to yield deeper insights into the nature of relativization problems and focus our attention on new and interesting classes of languages | |
| 520 | 3 | |a A complete and transparent characterization of oracles that separate NP from P would resolve the long-standing P =? NP question. In this note, we settle a central case. We fully characterize the sparse oracles separating NP from P in worlds where P = NP. We display related results about coNP, E, NE, coNE, and PSPACE | |
| 650 | 4 | |a Computational complexity | |
| 700 | 1 | |a Hemachandra, Lane |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 707 |w (DE-604)BV006185504 |9 707 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007061609 | ||
Datensatz im Suchindex
| _version_ | 1804125060543283200 |
|---|---|
| any_adam_object | |
| author | Hartmanis, Juris Hemachandra, Lane |
| author_facet | Hartmanis, Juris Hemachandra, Lane |
| author_role | aut aut |
| author_sort | Hartmanis, Juris |
| author_variant | j h jh l h lh |
| building | Verbundindex |
| bvnumber | BV010589741 |
| ctrlnum | (OCoLC)16474586 (DE-599)BVBBV010589741 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01821nam a2200313 cb4500</leader><controlfield tag="001">BV010589741</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960130s1985 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)16474586</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010589741</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="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hartmanis, Juris</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On sparse oracles separating feasible complexity classes</subfield><subfield code="c">Juris Hartmanis ; Lane Hemachandra</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 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">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">707</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This note clarifies which oracles separate NP from P and which do not. In essence, we are changing our research paradigm from the study of which problems can be relativized in two conflicting ways to the study and characterization of the class of oracles achieving a specified relativization. Results of this type have the potential to yield deeper insights into the nature of relativization problems and focus our attention on new and interesting classes of languages</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">A complete and transparent characterization of oracles that separate NP from P would resolve the long-standing P =? NP question. In this note, we settle a central case. We fully characterize the sparse oracles separating NP from P in worlds where P = NP. We display related results about coNP, E, NE, coNE, and PSPACE</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hemachandra, Lane</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: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">707</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">707</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007061609</subfield></datafield></record></collection> |
| id | DE-604.BV010589741 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:33Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007061609 |
| oclc_num | 16474586 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 16 S. |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Hartmanis, Juris Verfasser aut On sparse oracles separating feasible complexity classes Juris Hartmanis ; Lane Hemachandra Ithaca, New York 1985 16 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 707 This note clarifies which oracles separate NP from P and which do not. In essence, we are changing our research paradigm from the study of which problems can be relativized in two conflicting ways to the study and characterization of the class of oracles achieving a specified relativization. Results of this type have the potential to yield deeper insights into the nature of relativization problems and focus our attention on new and interesting classes of languages A complete and transparent characterization of oracles that separate NP from P would resolve the long-standing P =? NP question. In this note, we settle a central case. We fully characterize the sparse oracles separating NP from P in worlds where P = NP. We display related results about coNP, E, NE, coNE, and PSPACE Computational complexity Hemachandra, Lane Verfasser aut Department of Computer Science: Technical report Cornell University <Ithaca, NY> 707 (DE-604)BV006185504 707 |
| spellingShingle | Hartmanis, Juris Hemachandra, Lane On sparse oracles separating feasible complexity classes Computational complexity |
| title | On sparse oracles separating feasible complexity classes |
| title_auth | On sparse oracles separating feasible complexity classes |
| title_exact_search | On sparse oracles separating feasible complexity classes |
| title_full | On sparse oracles separating feasible complexity classes Juris Hartmanis ; Lane Hemachandra |
| title_fullStr | On sparse oracles separating feasible complexity classes Juris Hartmanis ; Lane Hemachandra |
| title_full_unstemmed | On sparse oracles separating feasible complexity classes Juris Hartmanis ; Lane Hemachandra |
| title_short | On sparse oracles separating feasible complexity classes |
| title_sort | on sparse oracles separating feasible complexity classes |
| topic | Computational complexity |
| topic_facet | Computational complexity |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT hartmanisjuris onsparseoraclesseparatingfeasiblecomplexityclasses AT hemachandralane onsparseoraclesseparatingfeasiblecomplexityclasses |