On the structure of feasible computations:
This paper discusses the study of computational complexity of feasible computations and surveys some recent insights and results about the structure of NP complete languages and the attempts to separate the classic complexity classes DLOGTAPE, NDLOGTAPE, PTIME, NPTIME,
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Ithaca, New York
1982
|
| Series: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
484 |
| Summary: | This paper discusses the study of computational complexity of feasible computations and surveys some recent insights and results about the structure of NP complete languages and the attempts to separate the classic complexity classes DLOGTAPE, NDLOGTAPE, PTIME, NPTIME, |
| Physical Description: | 22 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010581754 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960123s1982 |||| 00||| engod | ||
| 035 | |a (OCoLC)9237402 | ||
| 035 | |a (DE-599)BVBBV010581754 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 050 | 0 | |a QA267 | |
| 100 | 1 | |a Hartmanis, Juris |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On the structure of feasible computations |c J. Hartmanis |
| 264 | 1 | |a Ithaca, New York |c 1982 | |
| 300 | |a 22 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 484 | |
| 520 | 3 | |a This paper discusses the study of computational complexity of feasible computations and surveys some recent insights and results about the structure of NP complete languages and the attempts to separate the classic complexity classes DLOGTAPE, NDLOGTAPE, PTIME, NPTIME, | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 484 |w (DE-604)BV006185504 |9 484 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007054747 | ||
Record in the Search Index
| _version_ | 1804125050700300288 |
|---|---|
| any_adam_object | |
| author | Hartmanis, Juris |
| author_facet | Hartmanis, Juris |
| author_role | aut |
| author_sort | Hartmanis, Juris |
| author_variant | j h jh |
| building | Verbundindex |
| bvnumber | BV010581754 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267 |
| callnumber-search | QA267 |
| callnumber-sort | QA 3267 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)9237402 (DE-599)BVBBV010581754 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01181nam a2200289 cb4500</leader><controlfield tag="001">BV010581754</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960123s1982 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)9237402</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010581754</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="050" ind1=" " ind2="0"><subfield code="a">QA267</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 the structure of feasible computations</subfield><subfield code="c">J. Hartmanis</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1982</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">22 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">484</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This paper discusses the study of computational complexity of feasible computations and surveys some recent insights and results about the structure of NP complete languages and the attempts to separate the classic complexity classes DLOGTAPE, NDLOGTAPE, PTIME, NPTIME,</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">484</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">484</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007054747</subfield></datafield></record></collection> |
| id | DE-604.BV010581754 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:24Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007054747 |
| oclc_num | 9237402 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 22 S. |
| publishDate | 1982 |
| publishDateSearch | 1982 |
| publishDateSort | 1982 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Hartmanis, Juris Verfasser aut On the structure of feasible computations J. Hartmanis Ithaca, New York 1982 22 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 484 This paper discusses the study of computational complexity of feasible computations and surveys some recent insights and results about the structure of NP complete languages and the attempts to separate the classic complexity classes DLOGTAPE, NDLOGTAPE, PTIME, NPTIME, Department of Computer Science: Technical report Cornell University <Ithaca, NY> 484 (DE-604)BV006185504 484 |
| spellingShingle | Hartmanis, Juris On the structure of feasible computations |
| title | On the structure of feasible computations |
| title_auth | On the structure of feasible computations |
| title_exact_search | On the structure of feasible computations |
| title_full | On the structure of feasible computations J. Hartmanis |
| title_fullStr | On the structure of feasible computations J. Hartmanis |
| title_full_unstemmed | On the structure of feasible computations J. Hartmanis |
| title_short | On the structure of feasible computations |
| title_sort | on the structure of feasible computations |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT hartmanisjuris onthestructureoffeasiblecomputations |