The computational complexity of algebraic and numeric problems:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York [u.a.]
Elsevier
1975
|
| Schriftenreihe: | Elsevier computer science library: Theory of computation series
1 |
| Schlagworte: | |
| Beschreibung: | X, 174 S. graph. Darst. |
| ISBN: | 0444001565 0444001689 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV001963396 | ||
| 003 | DE-604 | ||
| 005 | 20110504 | ||
| 007 | t | ||
| 008 | 890928s1975 d||| |||| 00||| eng d | ||
| 020 | |a 0444001565 |9 0-444-00156-5 | ||
| 020 | |a 0444001689 |9 0-444-00168-9 | ||
| 035 | |a (OCoLC)251434119 | ||
| 035 | |a (DE-599)BVBBV001963396 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-739 |a DE-355 |a DE-20 |a DE-29T |a DE-83 |a DE-11 |a DE-188 | ||
| 050 | 0 | |a QA76 | |
| 082 | 0 | |a 519.7 | |
| 082 | 0 | |a 519.4 |2 18 | |
| 084 | |a SK 900 |0 (DE-625)143268: |2 rvk | ||
| 084 | |a SK 910 |0 (DE-625)143270: |2 rvk | ||
| 084 | |a 68C25 |2 msc | ||
| 100 | 1 | |a Borodin, Allan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The computational complexity of algebraic and numeric problems |c Allan Borodin ; Ian Munro |
| 264 | 1 | |a New York [u.a.] |b Elsevier |c 1975 | |
| 300 | |a X, 174 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Elsevier computer science library: Theory of computation series |v 1 | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 4 | |a Computational complexity | |
| 650 | 0 | 7 | |a Rekursivität |0 (DE-588)4443996-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Rekursivität |0 (DE-588)4443996-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Munro, Ian |e Verfasser |4 aut | |
| 830 | 0 | |a Elsevier computer science library: Theory of computation series |v 1 |w (DE-604)BV001900991 |9 1 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-001280401 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804116406368731136 |
|---|---|
| any_adam_object | |
| author | Borodin, Allan Munro, Ian |
| author_facet | Borodin, Allan Munro, Ian |
| author_role | aut aut |
| author_sort | Borodin, Allan |
| author_variant | a b ab i m im |
| building | Verbundindex |
| bvnumber | BV001963396 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76 |
| callnumber-search | QA76 |
| callnumber-sort | QA 276 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 900 SK 910 |
| ctrlnum | (OCoLC)251434119 (DE-599)BVBBV001963396 |
| dewey-full | 519.7 519.4 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.7 519.4 |
| dewey-search | 519.7 519.4 |
| dewey-sort | 3519.7 |
| 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>01739nam a2200481 cb4500</leader><controlfield tag="001">BV001963396</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20110504 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890928s1975 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0444001565</subfield><subfield code="9">0-444-00156-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0444001689</subfield><subfield code="9">0-444-00168-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)251434119</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV001963396</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-739</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.7</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.4</subfield><subfield code="2">18</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 900</subfield><subfield code="0">(DE-625)143268:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 910</subfield><subfield code="0">(DE-625)143270:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68C25</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Borodin, Allan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The computational complexity of algebraic and numeric problems</subfield><subfield code="c">Allan Borodin ; Ian Munro</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York [u.a.]</subfield><subfield code="b">Elsevier</subfield><subfield code="c">1975</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 174 S.</subfield><subfield code="b">graph. Darst.</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">Elsevier computer science library: Theory of computation series</subfield><subfield code="v">1</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rekursivität</subfield><subfield code="0">(DE-588)4443996-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="689" ind1="0" ind2="0"><subfield code="a">Rekursivität</subfield><subfield code="0">(DE-588)4443996-9</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="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Munro, Ian</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Elsevier computer science library: Theory of computation series</subfield><subfield code="v">1</subfield><subfield code="w">(DE-604)BV001900991</subfield><subfield code="9">1</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001280401</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV001963396 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T15:38:00Z |
| institution | BVB |
| isbn | 0444001565 0444001689 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001280401 |
| oclc_num | 251434119 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-739 DE-355 DE-BY-UBR DE-20 DE-29T DE-83 DE-11 DE-188 |
| owner_facet | DE-91G DE-BY-TUM DE-739 DE-355 DE-BY-UBR DE-20 DE-29T DE-83 DE-11 DE-188 |
| physical | X, 174 S. graph. Darst. |
| publishDate | 1975 |
| publishDateSearch | 1975 |
| publishDateSort | 1975 |
| publisher | Elsevier |
| record_format | marc |
| series | Elsevier computer science library: Theory of computation series |
| series2 | Elsevier computer science library: Theory of computation series |
| spelling | Borodin, Allan Verfasser aut The computational complexity of algebraic and numeric problems Allan Borodin ; Ian Munro New York [u.a.] Elsevier 1975 X, 174 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Elsevier computer science library: Theory of computation series 1 Complexité de calcul (Informatique) Computational complexity Rekursivität (DE-588)4443996-9 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Rekursivität (DE-588)4443996-9 s DE-604 Komplexitätstheorie (DE-588)4120591-1 s 1\p DE-604 Munro, Ian Verfasser aut Elsevier computer science library: Theory of computation series 1 (DE-604)BV001900991 1 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Borodin, Allan Munro, Ian The computational complexity of algebraic and numeric problems Elsevier computer science library: Theory of computation series Complexité de calcul (Informatique) Computational complexity Rekursivität (DE-588)4443996-9 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| subject_GND | (DE-588)4443996-9 (DE-588)4120591-1 |
| title | The computational complexity of algebraic and numeric problems |
| title_auth | The computational complexity of algebraic and numeric problems |
| title_exact_search | The computational complexity of algebraic and numeric problems |
| title_full | The computational complexity of algebraic and numeric problems Allan Borodin ; Ian Munro |
| title_fullStr | The computational complexity of algebraic and numeric problems Allan Borodin ; Ian Munro |
| title_full_unstemmed | The computational complexity of algebraic and numeric problems Allan Borodin ; Ian Munro |
| title_short | The computational complexity of algebraic and numeric problems |
| title_sort | the computational complexity of algebraic and numeric problems |
| topic | Complexité de calcul (Informatique) Computational complexity Rekursivität (DE-588)4443996-9 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| topic_facet | Complexité de calcul (Informatique) Computational complexity Rekursivität Komplexitätstheorie |
| volume_link | (DE-604)BV001900991 |
| work_keys_str_mv | AT borodinallan thecomputationalcomplexityofalgebraicandnumericproblems AT munroian thecomputationalcomplexityofalgebraicandnumericproblems |