Feasible computations and provable complexity properties:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Philadelphia, Pa.
Soc. for Industrial and Applied Mathematics
1978
|
| Schriftenreihe: | National Science Foundation / Conference Board of the Mathematical Sciences: CBMS-NSF regional conference series in applied mathematics
30 |
| Schlagworte: | |
| Beschreibung: | 62 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV002259519 | ||
| 003 | DE-604 | ||
| 005 | 20170703 | ||
| 007 | t | ||
| 008 | 890928s1978 |||| 00||| eng d | ||
| 035 | |a (OCoLC)4135502 | ||
| 035 | |a (DE-599)BVBBV002259519 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-384 |a DE-739 |a DE-355 |a DE-20 |a DE-29T |a DE-19 |a DE-83 | ||
| 050 | 0 | |a QA267 | |
| 082 | 0 | |a 519.4 | |
| 084 | |a SI 196 |0 (DE-625)143099: |2 rvk | ||
| 100 | 1 | |a Hartmanis, Juris |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Feasible computations and provable complexity properties |c Juris Hartmanis |
| 264 | 1 | |a Philadelphia, Pa. |b Soc. for Industrial and Applied Mathematics |c 1978 | |
| 300 | |a 62 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a National Science Foundation / Conference Board of the Mathematical Sciences: CBMS-NSF regional conference series in applied mathematics |v 30 | |
| 650 | 4 | |a Automates mathématiques, Théorie des | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 7 | |a Computabilidade E Modelos De Computacao |2 larpcal | |
| 650 | 7 | |a Formele talen |2 gtt | |
| 650 | 4 | |a Langages formels | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Formal languages | |
| 650 | 4 | |a Machine theory | |
| 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 | |
| 940 | 1 | |q TUB-www | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-001484897 | ||
Datensatz im Suchindex
| _version_ | 1804116716691652608 |
|---|---|
| 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 | BV002259519 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267 |
| callnumber-search | QA267 |
| callnumber-sort | QA 3267 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SI 196 |
| ctrlnum | (OCoLC)4135502 (DE-599)BVBBV002259519 |
| dewey-full | 519.4 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.4 |
| dewey-search | 519.4 |
| dewey-sort | 3519.4 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01865nam a2200481 cb4500</leader><controlfield tag="001">BV002259519</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170703 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890928s1978 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)4135502</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002259519</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><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.4</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 196</subfield><subfield code="0">(DE-625)143099:</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="264" ind1=" " ind2="1"><subfield code="a">Philadelphia, Pa.</subfield><subfield code="b">Soc. for Industrial and Applied Mathematics</subfield><subfield code="c">1978</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">National Science Foundation / Conference Board of the Mathematical Sciences: CBMS-NSF regional conference series in applied mathematics</subfield><subfield code="v">30</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automates mathématiques, Théorie des</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computabilidade E Modelos De Computacao</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Formele talen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Langages formels</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</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="940" ind1="1" ind2=" "><subfield code="q">TUB-www</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001484897</subfield></datafield></record></collection> |
| id | DE-604.BV002259519 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T15:42:56Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001484897 |
| oclc_num | 4135502 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-384 DE-739 DE-355 DE-BY-UBR DE-20 DE-29T DE-19 DE-BY-UBM DE-83 |
| owner_facet | DE-91G DE-BY-TUM DE-384 DE-739 DE-355 DE-BY-UBR DE-20 DE-29T DE-19 DE-BY-UBM DE-83 |
| physical | 62 S. |
| psigel | TUB-www |
| publishDate | 1978 |
| publishDateSearch | 1978 |
| publishDateSort | 1978 |
| publisher | Soc. for Industrial and Applied Mathematics |
| record_format | marc |
| series2 | National Science Foundation / Conference Board of the Mathematical Sciences: CBMS-NSF regional conference series in applied mathematics |
| spelling | Hartmanis, Juris Verfasser aut Feasible computations and provable complexity properties Juris Hartmanis Philadelphia, Pa. Soc. for Industrial and Applied Mathematics 1978 62 S. txt rdacontent n rdamedia nc rdacarrier National Science Foundation / Conference Board of the Mathematical Sciences: CBMS-NSF regional conference series in applied mathematics 30 Automates mathématiques, Théorie des Complexité de calcul (Informatique) Computabilidade E Modelos De Computacao larpcal Formele talen gtt Langages formels Computational complexity Formal languages Machine theory 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 Automates mathématiques, Théorie des Complexité de calcul (Informatique) Computabilidade E Modelos De Computacao larpcal Formele talen gtt Langages formels Computational complexity Formal languages Machine theory 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 | Automates mathématiques, Théorie des Complexité de calcul (Informatique) Computabilidade E Modelos De Computacao larpcal Formele talen gtt Langages formels Computational complexity Formal languages Machine theory Komplexitätstheorie (DE-588)4120591-1 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | Automates mathématiques, Théorie des Complexité de calcul (Informatique) Computabilidade E Modelos De Computacao Formele talen Langages formels Computational complexity Formal languages Machine theory Komplexitätstheorie Berechnungskomplexität |
| volume_link | (DE-604)BV000016696 |
| work_keys_str_mv | AT hartmanisjuris feasiblecomputationsandprovablecomplexityproperties |