Feasible computations and provable complexity properties:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Philadelphia, Pa.
Soc. for Industrial and Appl. Math.
1989
|
| Ausgabe: | Repr. |
| Schriftenreihe: | CBMS-NSF regional conference series in applied mathematics
30 |
| Schlagworte: | |
| Beschreibung: | 62 S. |
| ISBN: | 0898710278 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV025262586 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 100417s1989 |||| 00||| eng d | ||
| 020 | |a 0898710278 |9 0-89871-027-8 | ||
| 035 | |a (OCoLC)916450203 | ||
| 035 | |a (DE-599)BVBBV025262586 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-11 | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 100 | 1 | |a Hartmanis, Juris |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Feasible computations and provable complexity properties |c Juris Hartmanis |
| 250 | |a Repr. | ||
| 264 | 1 | |a Philadelphia, Pa. |b Soc. for Industrial and Appl. Math. |c 1989 | |
| 300 | |a 62 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a CBMS-NSF regional conference series in applied mathematics |v 30 | |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 810 | 2 | |a National Science Foundation |p Conference Board of the Mathematical Sciences |t CBMS-NSF regional conference series in applied mathematics |v 30 |w (DE-604)BV000016696 |9 30 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-019898626 | ||
Datensatz im Suchindex
| _version_ | 1804142323149307904 |
|---|---|
| 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 | BV025262586 |
| classification_rvk | ST 130 |
| ctrlnum | (OCoLC)916450203 (DE-599)BVBBV025262586 |
| discipline | Informatik |
| edition | Repr. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01376nam a2200373 cb4500</leader><controlfield tag="001">BV025262586</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100417s1989 |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0898710278</subfield><subfield code="9">0-89871-027-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)916450203</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV025262586</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</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">Feasible computations and provable complexity properties</subfield><subfield code="c">Juris Hartmanis</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Repr.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Philadelphia, Pa.</subfield><subfield code="b">Soc. for Industrial and Appl. Math.</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">62 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">CBMS-NSF regional conference series in applied mathematics</subfield><subfield code="v">30</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">National Science Foundation</subfield><subfield code="p">Conference Board of the Mathematical Sciences</subfield><subfield code="t">CBMS-NSF regional conference series in applied mathematics</subfield><subfield code="v">30</subfield><subfield code="w">(DE-604)BV000016696</subfield><subfield code="9">30</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-019898626</subfield></datafield></record></collection> |
| id | DE-604.BV025262586 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T22:29:56Z |
| institution | BVB |
| isbn | 0898710278 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-019898626 |
| oclc_num | 916450203 |
| open_access_boolean | |
| owner | DE-11 |
| owner_facet | DE-11 |
| physical | 62 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| publisher | Soc. for Industrial and Appl. Math. |
| record_format | marc |
| series2 | CBMS-NSF regional conference series in applied mathematics |
| spelling | Hartmanis, Juris Verfasser aut Feasible computations and provable complexity properties Juris Hartmanis Repr. Philadelphia, Pa. Soc. for Industrial and Appl. Math. 1989 62 S. txt rdacontent n rdamedia nc rdacarrier CBMS-NSF regional conference series in applied mathematics 30 Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 s DE-604 Komplexitätstheorie (DE-588)4120591-1 s National Science Foundation Conference Board of the Mathematical Sciences CBMS-NSF regional conference series in applied mathematics 30 (DE-604)BV000016696 30 |
| spellingShingle | Hartmanis, Juris Feasible computations and provable complexity properties Komplexitätstheorie (DE-588)4120591-1 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4120591-1 (DE-588)4134751-1 |
| title | Feasible computations and provable complexity properties |
| title_auth | Feasible computations and provable complexity properties |
| title_exact_search | Feasible computations and provable complexity properties |
| title_full | Feasible computations and provable complexity properties Juris Hartmanis |
| title_fullStr | Feasible computations and provable complexity properties Juris Hartmanis |
| title_full_unstemmed | Feasible computations and provable complexity properties Juris Hartmanis |
| title_short | Feasible computations and provable complexity properties |
| title_sort | feasible computations and provable complexity properties |
| topic | Komplexitätstheorie (DE-588)4120591-1 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | Komplexitätstheorie Berechnungskomplexität |
| volume_link | (DE-604)BV000016696 |
| work_keys_str_mv | AT hartmanisjuris feasiblecomputationsandprovablecomplexityproperties |