An upper bound for the expected complexity of finding all zeros of a continuous function by brute force:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
Hildesheim
Hochsch.
1986
|
| Schriftenreihe: | Hildesheimer Informatik-Berichte
[1986,1] |
| Schlagworte: | |
| Beschreibung: | 18 Bl. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV003677315 | ||
| 003 | DE-604 | ||
| 005 | 19940218 | ||
| 007 | t | ||
| 008 | 900813s1986 gw d||| |||| 00||| ger d | ||
| 035 | |a (OCoLC)75168968 | ||
| 035 | |a (DE-599)BVBBV003677315 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-91G | ||
| 100 | 1 | |a Doberkat, Ernst-Erich |d 1948- |e Verfasser |0 (DE-588)12244728X |4 aut | |
| 245 | 1 | 0 | |a An upper bound for the expected complexity of finding all zeros of a continuous function by brute force |c Ernst-Erich Doberkat. Hochsch. Hildesheim |
| 264 | 1 | |a Hildesheim |b Hochsch. |c 1986 | |
| 300 | |a 18 Bl. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Hildesheimer Informatik-Berichte |v [1986,1] | |
| 650 | 0 | 7 | |a Nullstelle |0 (DE-588)4140515-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Nullstelle |0 (DE-588)4140515-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Hildesheimer Informatik-Berichte |v [1986,1] |w (DE-604)BV002483135 |9 1986,1 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-002339759 | ||
Datensatz im Suchindex
| _version_ | 1804118021552209920 |
|---|---|
| any_adam_object | |
| author | Doberkat, Ernst-Erich 1948- |
| author_GND | (DE-588)12244728X |
| author_facet | Doberkat, Ernst-Erich 1948- |
| author_role | aut |
| author_sort | Doberkat, Ernst-Erich 1948- |
| author_variant | e e d eed |
| building | Verbundindex |
| bvnumber | BV003677315 |
| ctrlnum | (OCoLC)75168968 (DE-599)BVBBV003677315 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01090nam a2200313 cb4500</leader><controlfield tag="001">BV003677315</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19940218 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">900813s1986 gw d||| |||| 00||| ger d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)75168968</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV003677315</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">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Doberkat, Ernst-Erich</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)12244728X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An upper bound for the expected complexity of finding all zeros of a continuous function by brute force</subfield><subfield code="c">Ernst-Erich Doberkat. Hochsch. Hildesheim</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hildesheim</subfield><subfield code="b">Hochsch.</subfield><subfield code="c">1986</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18 Bl.</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">Hildesheimer Informatik-Berichte</subfield><subfield code="v">[1986,1]</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Nullstelle</subfield><subfield code="0">(DE-588)4140515-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Nullstelle</subfield><subfield code="0">(DE-588)4140515-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Hildesheimer Informatik-Berichte</subfield><subfield code="v">[1986,1]</subfield><subfield code="w">(DE-604)BV002483135</subfield><subfield code="9">1986,1</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002339759</subfield></datafield></record></collection> |
| id | DE-604.BV003677315 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T16:03:40Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002339759 |
| oclc_num | 75168968 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 18 Bl. graph. Darst. |
| publishDate | 1986 |
| publishDateSearch | 1986 |
| publishDateSort | 1986 |
| publisher | Hochsch. |
| record_format | marc |
| series | Hildesheimer Informatik-Berichte |
| series2 | Hildesheimer Informatik-Berichte |
| spelling | Doberkat, Ernst-Erich 1948- Verfasser (DE-588)12244728X aut An upper bound for the expected complexity of finding all zeros of a continuous function by brute force Ernst-Erich Doberkat. Hochsch. Hildesheim Hildesheim Hochsch. 1986 18 Bl. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Hildesheimer Informatik-Berichte [1986,1] Nullstelle (DE-588)4140515-8 gnd rswk-swf Nullstelle (DE-588)4140515-8 s DE-604 Hildesheimer Informatik-Berichte [1986,1] (DE-604)BV002483135 1986,1 |
| spellingShingle | Doberkat, Ernst-Erich 1948- An upper bound for the expected complexity of finding all zeros of a continuous function by brute force Hildesheimer Informatik-Berichte Nullstelle (DE-588)4140515-8 gnd |
| subject_GND | (DE-588)4140515-8 |
| title | An upper bound for the expected complexity of finding all zeros of a continuous function by brute force |
| title_auth | An upper bound for the expected complexity of finding all zeros of a continuous function by brute force |
| title_exact_search | An upper bound for the expected complexity of finding all zeros of a continuous function by brute force |
| title_full | An upper bound for the expected complexity of finding all zeros of a continuous function by brute force Ernst-Erich Doberkat. Hochsch. Hildesheim |
| title_fullStr | An upper bound for the expected complexity of finding all zeros of a continuous function by brute force Ernst-Erich Doberkat. Hochsch. Hildesheim |
| title_full_unstemmed | An upper bound for the expected complexity of finding all zeros of a continuous function by brute force Ernst-Erich Doberkat. Hochsch. Hildesheim |
| title_short | An upper bound for the expected complexity of finding all zeros of a continuous function by brute force |
| title_sort | an upper bound for the expected complexity of finding all zeros of a continuous function by brute force |
| topic | Nullstelle (DE-588)4140515-8 gnd |
| topic_facet | Nullstelle |
| volume_link | (DE-604)BV002483135 |
| work_keys_str_mv | AT doberkaternsterich anupperboundfortheexpectedcomplexityoffindingallzerosofacontinuousfunctionbybruteforce |