Complexity classes without machines: on complete languages for UP
This paper develops techniques for studying complexity classes that are not covered by known recursive enumerations of machines. Often, counting classes, probabilistic classes, and intersection classes lack such enumerations. Concentrating on the counting class UP, we show that there are relativizat...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, New York
1986
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
746 |
| Schlagworte: | |
| Zusammenfassung: | This paper develops techniques for studying complexity classes that are not covered by known recursive enumerations of machines. Often, counting classes, probabilistic classes, and intersection classes lack such enumerations. Concentrating on the counting class UP, we show that there are relativizations for which . - f |
| Beschreibung: | 17 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010594393 | ||
| 003 | DE-604 | ||
| 005 | 20100419 | ||
| 007 | t | ||
| 008 | 960201s1986 |||| 00||| engod | ||
| 035 | |a (OCoLC)14706131 | ||
| 035 | |a (DE-599)BVBBV010594393 | ||
| 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 Complexity classes without machines |b on complete languages for UP |c Juris Hartmanis ; Lane Hemachandra |
| 264 | 1 | |a Ithaca, New York |c 1986 | |
| 300 | |a 17 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 746 | |
| 520 | 3 | |a This paper develops techniques for studying complexity classes that are not covered by known recursive enumerations of machines. Often, counting classes, probabilistic classes, and intersection classes lack such enumerations. Concentrating on the counting class UP, we show that there are relativizations for which . - f | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Languages, Artificial | |
| 700 | 1 | |a Hemachandra, Lane |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 746 |w (DE-604)BV006185504 |9 746 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007065019 | ||
Datensatz im Suchindex
| _version_ | 1804125065658236928 |
|---|---|
| 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 | BV010594393 |
| ctrlnum | (OCoLC)14706131 (DE-599)BVBBV010594393 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01386nam a2200313 cb4500</leader><controlfield tag="001">BV010594393</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100419 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960201s1986 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)14706131</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010594393</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">Complexity classes without machines</subfield><subfield code="b">on complete languages for UP</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">1986</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17 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">746</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This paper develops techniques for studying complexity classes that are not covered by known recursive enumerations of machines. Often, counting classes, probabilistic classes, and intersection classes lack such enumerations. Concentrating on the counting class UP, we show that there are relativizations for which . - f</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Languages, Artificial</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">746</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">746</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007065019</subfield></datafield></record></collection> |
| id | DE-604.BV010594393 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:38Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007065019 |
| oclc_num | 14706131 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 17 S. |
| publishDate | 1986 |
| publishDateSearch | 1986 |
| publishDateSort | 1986 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Hartmanis, Juris Verfasser aut Complexity classes without machines on complete languages for UP Juris Hartmanis ; Lane Hemachandra Ithaca, New York 1986 17 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 746 This paper develops techniques for studying complexity classes that are not covered by known recursive enumerations of machines. Often, counting classes, probabilistic classes, and intersection classes lack such enumerations. Concentrating on the counting class UP, we show that there are relativizations for which . - f Computational complexity Languages, Artificial Hemachandra, Lane Verfasser aut Department of Computer Science: Technical report Cornell University <Ithaca, NY> 746 (DE-604)BV006185504 746 |
| spellingShingle | Hartmanis, Juris Hemachandra, Lane Complexity classes without machines on complete languages for UP Computational complexity Languages, Artificial |
| title | Complexity classes without machines on complete languages for UP |
| title_auth | Complexity classes without machines on complete languages for UP |
| title_exact_search | Complexity classes without machines on complete languages for UP |
| title_full | Complexity classes without machines on complete languages for UP Juris Hartmanis ; Lane Hemachandra |
| title_fullStr | Complexity classes without machines on complete languages for UP Juris Hartmanis ; Lane Hemachandra |
| title_full_unstemmed | Complexity classes without machines on complete languages for UP Juris Hartmanis ; Lane Hemachandra |
| title_short | Complexity classes without machines |
| title_sort | complexity classes without machines on complete languages for up |
| title_sub | on complete languages for UP |
| topic | Computational complexity Languages, Artificial |
| topic_facet | Computational complexity Languages, Artificial |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT hartmanisjuris complexityclasseswithoutmachinesoncompletelanguagesforup AT hemachandralane complexityclasseswithoutmachinesoncompletelanguagesforup |