Collapsing degrees via strong computation:
Abstract: "Though Berman and others have provided powerful techniques to collapse nondeterministic degrees at and above nondeterministic linear space, and Immerman and Szelepcsényi have provided techniques that collapse even sublinear nondeterministic space classes, it has remained an open prob...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Rochester, NY
1990
|
| Series: | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report
361 |
| Subjects: | |
| Summary: | Abstract: "Though Berman and others have provided powerful techniques to collapse nondeterministic degrees at and above nondeterministic linear space, and Immerman and Szelepcsényi have provided techniques that collapse even sublinear nondeterministic space classes, it has remained an open problem whether any collapses could be proven for sublinear nondeterministic space degrees. This paper provides the first such collapses. For nondeterministic space classes C above NL, we show that all [formula]-complete sets for C collapse to a single [formula] degree (i.e., all [formula]-complete sets for C are [formula]-equivalent), and that all [formula]-complete sets for C are NL-isomorphic (and thus P- isomorphic). Our techniques sharply improve previous results for PSPACE." |
| Physical Description: | 18 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008974836 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)25621857 | ||
| 035 | |a (DE-599)BVBBV008974836 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Hemachandra, Lane A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Collapsing degrees via strong computation |c Lane A. Hemachandra ; Albrecht Hoene |
| 264 | 1 | |a Rochester, NY |c 1990 | |
| 300 | |a 18 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |v 361 | |
| 520 | 3 | |a Abstract: "Though Berman and others have provided powerful techniques to collapse nondeterministic degrees at and above nondeterministic linear space, and Immerman and Szelepcsényi have provided techniques that collapse even sublinear nondeterministic space classes, it has remained an open problem whether any collapses could be proven for sublinear nondeterministic space degrees. This paper provides the first such collapses. For nondeterministic space classes C above NL, we show that all [formula]-complete sets for C collapse to a single [formula] degree (i.e., all [formula]-complete sets for C are [formula]-equivalent), and that all [formula]-complete sets for C are NL-isomorphic (and thus P- isomorphic). Our techniques sharply improve previous results for PSPACE." | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a NP-complete problems | |
| 700 | 1 | |a Hoene, Albrecht |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Rochester <Rochester, NY> |v 361 |w (DE-604)BV008902697 |9 361 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005926366 | ||
Record in the Search Index
| _version_ | 1804123312920461312 |
|---|---|
| any_adam_object | |
| author | Hemachandra, Lane A. Hoene, Albrecht |
| author_facet | Hemachandra, Lane A. Hoene, Albrecht |
| author_role | aut aut |
| author_sort | Hemachandra, Lane A. |
| author_variant | l a h la lah a h ah |
| building | Verbundindex |
| bvnumber | BV008974836 |
| ctrlnum | (OCoLC)25621857 (DE-599)BVBBV008974836 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01835nam a2200313 cb4500</leader><controlfield tag="001">BV008974836</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25621857</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008974836</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hemachandra, Lane A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Collapsing degrees via strong computation</subfield><subfield code="c">Lane A. Hemachandra ; Albrecht Hoene</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Rochester, NY</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18 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">University of Rochester <Rochester, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">361</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Though Berman and others have provided powerful techniques to collapse nondeterministic degrees at and above nondeterministic linear space, and Immerman and Szelepcsényi have provided techniques that collapse even sublinear nondeterministic space classes, it has remained an open problem whether any collapses could be proven for sublinear nondeterministic space degrees. This paper provides the first such collapses. For nondeterministic space classes C above NL, we show that all [formula]-complete sets for C collapse to a single [formula] degree (i.e., all [formula]-complete sets for C are [formula]-equivalent), and that all [formula]-complete sets for C are NL-isomorphic (and thus P- isomorphic). Our techniques sharply improve previous results for PSPACE."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">NP-complete problems</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hoene, Albrecht</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">University of Rochester <Rochester, NY></subfield><subfield code="v">361</subfield><subfield code="w">(DE-604)BV008902697</subfield><subfield code="9">361</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005926366</subfield></datafield></record></collection> |
| id | DE-604.BV008974836 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:47Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005926366 |
| oclc_num | 25621857 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 18 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |
| spelling | Hemachandra, Lane A. Verfasser aut Collapsing degrees via strong computation Lane A. Hemachandra ; Albrecht Hoene Rochester, NY 1990 18 S. txt rdacontent n rdamedia nc rdacarrier University of Rochester <Rochester, NY> / Department of Computer Science: Technical report 361 Abstract: "Though Berman and others have provided powerful techniques to collapse nondeterministic degrees at and above nondeterministic linear space, and Immerman and Szelepcsényi have provided techniques that collapse even sublinear nondeterministic space classes, it has remained an open problem whether any collapses could be proven for sublinear nondeterministic space degrees. This paper provides the first such collapses. For nondeterministic space classes C above NL, we show that all [formula]-complete sets for C collapse to a single [formula] degree (i.e., all [formula]-complete sets for C are [formula]-equivalent), and that all [formula]-complete sets for C are NL-isomorphic (and thus P- isomorphic). Our techniques sharply improve previous results for PSPACE." Computational complexity NP-complete problems Hoene, Albrecht Verfasser aut Department of Computer Science: Technical report University of Rochester <Rochester, NY> 361 (DE-604)BV008902697 361 |
| spellingShingle | Hemachandra, Lane A. Hoene, Albrecht Collapsing degrees via strong computation Computational complexity NP-complete problems |
| title | Collapsing degrees via strong computation |
| title_auth | Collapsing degrees via strong computation |
| title_exact_search | Collapsing degrees via strong computation |
| title_full | Collapsing degrees via strong computation Lane A. Hemachandra ; Albrecht Hoene |
| title_fullStr | Collapsing degrees via strong computation Lane A. Hemachandra ; Albrecht Hoene |
| title_full_unstemmed | Collapsing degrees via strong computation Lane A. Hemachandra ; Albrecht Hoene |
| title_short | Collapsing degrees via strong computation |
| title_sort | collapsing degrees via strong computation |
| topic | Computational complexity NP-complete problems |
| topic_facet | Computational complexity NP-complete problems |
| volume_link | (DE-604)BV008902697 |
| work_keys_str_mv | AT hemachandralanea collapsingdegreesviastrongcomputation AT hoenealbrecht collapsingdegreesviastrongcomputation |