Rzecz o istocie informatyki: algorytmika
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | Polish |
| Veröffentlicht: |
Warszawa
Wydawnictwa Naukowo-Techniczene
2001
|
| Ausgabe: | Wyd. 3. |
| Schriftenreihe: | Klasyka informatyki
|
| Schlagworte: | |
| Beschreibung: | Aus dem Engl. übers. |
| Beschreibung: | 428 S. graph. Darst. |
| ISBN: | 832042688X |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV023529762 | ||
| 003 | DE-604 | ||
| 005 | 20041012000000.0 | ||
| 007 | t | ||
| 008 | 031027s2001 pl d||| |||| 00||| pol d | ||
| 020 | |a 832042688X |9 83-204-2688-X | ||
| 035 | |a (OCoLC)915858757 | ||
| 035 | |a (DE-599)BVBBV023529762 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a pol | |
| 044 | |a pl |c XA-PL | ||
| 049 | |a DE-521 | ||
| 100 | 1 | |a Harel, David |d 1950- |e Verfasser |0 (DE-588)109527992 |4 aut | |
| 240 | 1 | 0 | |a Algorithmics |
| 245 | 1 | 0 | |a Rzecz o istocie informatyki |b algorytmika |c David Harel |
| 250 | |a Wyd. 3. | ||
| 264 | 1 | |a Warszawa |b Wydawnictwa Naukowo-Techniczene |c 2001 | |
| 300 | |a 428 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Klasyka informatyki | |
| 500 | |a Aus dem Engl. übers. | ||
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmische Programmierung |0 (DE-588)4293504-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmische Programmiersprache |0 (DE-588)4141876-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmentheorie |0 (DE-588)4200409-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmverifikation |0 (DE-588)4135576-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Softwareentwicklung |0 (DE-588)4116522-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Beweis |0 (DE-588)4132532-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Korrektheit |0 (DE-588)4240223-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmiersprache |0 (DE-588)4047409-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenverarbeitung |0 (DE-588)4011152-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmierung |0 (DE-588)4076370-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |2 gnd |9 rswk-swf |
| 653 | |a Algorytmy. | ||
| 689 | 0 | 0 | |a Softwareentwicklung |0 (DE-588)4116522-6 |D s |
| 689 | 0 | 1 | |a Algorithmische Programmiersprache |0 (DE-588)4141876-1 |D s |
| 689 | 0 | 2 | |a Programmverifikation |0 (DE-588)4135576-3 |D s |
| 689 | 0 | 3 | |a Korrektheit |0 (DE-588)4240223-2 |D s |
| 689 | 0 | 4 | |a Beweis |0 (DE-588)4132532-1 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | 1 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 1 | 2 | |a Programmiersprache |0 (DE-588)4047409-4 |D s |
| 689 | 1 | 3 | |a Korrektheit |0 (DE-588)4240223-2 |D s |
| 689 | 1 | 4 | |a Programmverifikation |0 (DE-588)4135576-3 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 689 | 2 | 0 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 2 | 1 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
| 689 | 2 | 2 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 2 | |8 3\p |5 DE-604 | |
| 689 | 3 | 0 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
| 689 | 3 | 1 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 3 | 2 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 3 | |8 4\p |5 DE-604 | |
| 689 | 4 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 4 | 1 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 4 | |8 5\p |5 DE-604 | |
| 689 | 5 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 5 | 1 | |a Datenverarbeitung |0 (DE-588)4011152-0 |D s |
| 689 | 5 | |8 6\p |5 DE-604 | |
| 689 | 6 | 0 | |a Algorithmische Programmierung |0 (DE-588)4293504-0 |D s |
| 689 | 6 | |8 7\p |5 DE-604 | |
| 689 | 7 | 0 | |a Algorithmentheorie |0 (DE-588)4200409-3 |D s |
| 689 | 7 | |8 8\p |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016849955 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 5\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 6\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 7\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 8\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804138175073878016 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Harel, David 1950- |
| author_GND | (DE-588)109527992 |
| author_facet | Harel, David 1950- |
| author_role | aut |
| author_sort | Harel, David 1950- |
| author_variant | d h dh |
| building | Verbundindex |
| bvnumber | BV023529762 |
| ctrlnum | (OCoLC)915858757 (DE-599)BVBBV023529762 |
| edition | Wyd. 3. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04085nam a2200961zc 4500</leader><controlfield tag="001">BV023529762</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20041012000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">031027s2001 pl d||| |||| 00||| pol d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">832042688X</subfield><subfield code="9">83-204-2688-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)915858757</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023529762</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">pol</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">pl</subfield><subfield code="c">XA-PL</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-521</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Harel, David</subfield><subfield code="d">1950-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)109527992</subfield><subfield code="4">aut</subfield></datafield><datafield tag="240" ind1="1" ind2="0"><subfield code="a">Algorithmics</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Rzecz o istocie informatyki</subfield><subfield code="b">algorytmika</subfield><subfield code="c">David Harel</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Wyd. 3.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Warszawa</subfield><subfield code="b">Wydawnictwa Naukowo-Techniczene</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">428 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="0" ind2=" "><subfield code="a">Klasyka informatyki</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Aus dem Engl. übers.</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">Algorithmische Programmierung</subfield><subfield code="0">(DE-588)4293504-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Programmiersprache</subfield><subfield code="0">(DE-588)4141876-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmverifikation</subfield><subfield code="0">(DE-588)4135576-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Softwareentwicklung</subfield><subfield code="0">(DE-588)4116522-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Beweis</subfield><subfield code="0">(DE-588)4132532-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Korrektheit</subfield><subfield code="0">(DE-588)4240223-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Algorytmy.</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Softwareentwicklung</subfield><subfield code="0">(DE-588)4116522-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmische Programmiersprache</subfield><subfield code="0">(DE-588)4141876-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Programmverifikation</subfield><subfield code="0">(DE-588)4135576-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Korrektheit</subfield><subfield code="0">(DE-588)4240223-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Beweis</subfield><subfield code="0">(DE-588)4132532-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="3"><subfield code="a">Korrektheit</subfield><subfield code="0">(DE-588)4240223-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="4"><subfield code="a">Programmverifikation</subfield><subfield code="0">(DE-588)4135576-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="2"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="2"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2="1"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2="1"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="8">6\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="6" ind2="0"><subfield code="a">Algorithmische Programmierung</subfield><subfield code="0">(DE-588)4293504-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="6" ind2=" "><subfield code="8">7\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="7" ind2="0"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="7" ind2=" "><subfield code="8">8\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016849955</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">5\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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">6\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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">7\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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">8\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.BV023529762 |
| illustrated | Illustrated |
| index_date | 2024-07-02T22:34:51Z |
| indexdate | 2024-07-09T21:24:00Z |
| institution | BVB |
| isbn | 832042688X |
| language | Polish |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016849955 |
| oclc_num | 915858757 |
| open_access_boolean | |
| owner | DE-521 |
| owner_facet | DE-521 |
| physical | 428 S. graph. Darst. |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Wydawnictwa Naukowo-Techniczene |
| record_format | marc |
| series2 | Klasyka informatyki |
| spelling | Harel, David 1950- Verfasser (DE-588)109527992 aut Algorithmics Rzecz o istocie informatyki algorytmika David Harel Wyd. 3. Warszawa Wydawnictwa Naukowo-Techniczene 2001 428 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Klasyka informatyki Aus dem Engl. übers. Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Algorithmische Programmierung (DE-588)4293504-0 gnd rswk-swf Algorithmische Programmiersprache (DE-588)4141876-1 gnd rswk-swf Algorithmentheorie (DE-588)4200409-3 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Programmverifikation (DE-588)4135576-3 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Softwareentwicklung (DE-588)4116522-6 gnd rswk-swf Beweis (DE-588)4132532-1 gnd rswk-swf Korrektheit (DE-588)4240223-2 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Programmiersprache (DE-588)4047409-4 gnd rswk-swf Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf Programmierung (DE-588)4076370-5 gnd rswk-swf Effizienter Algorithmus (DE-588)4125422-3 gnd rswk-swf Algorytmy. Softwareentwicklung (DE-588)4116522-6 s Algorithmische Programmiersprache (DE-588)4141876-1 s Programmverifikation (DE-588)4135576-3 s Korrektheit (DE-588)4240223-2 s Beweis (DE-588)4132532-1 s 1\p DE-604 Algorithmus (DE-588)4001183-5 s Programmierung (DE-588)4076370-5 s Programmiersprache (DE-588)4047409-4 s 2\p DE-604 Effizienter Algorithmus (DE-588)4125422-3 s Berechenbarkeit (DE-588)4138368-0 s 3\p DE-604 Komplexitätstheorie (DE-588)4120591-1 s 4\p DE-604 Informatik (DE-588)4026894-9 s 5\p DE-604 Datenverarbeitung (DE-588)4011152-0 s 6\p DE-604 Algorithmische Programmierung (DE-588)4293504-0 s 7\p DE-604 Algorithmentheorie (DE-588)4200409-3 s 8\p DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 5\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 6\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 7\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 8\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Harel, David 1950- Rzecz o istocie informatyki algorytmika Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd Algorithmische Programmiersprache (DE-588)4141876-1 gnd Algorithmentheorie (DE-588)4200409-3 gnd Algorithmus (DE-588)4001183-5 gnd Programmverifikation (DE-588)4135576-3 gnd Berechenbarkeit (DE-588)4138368-0 gnd Softwareentwicklung (DE-588)4116522-6 gnd Beweis (DE-588)4132532-1 gnd Korrektheit (DE-588)4240223-2 gnd Informatik (DE-588)4026894-9 gnd Programmiersprache (DE-588)4047409-4 gnd Datenverarbeitung (DE-588)4011152-0 gnd Programmierung (DE-588)4076370-5 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd |
| subject_GND | (DE-588)4120591-1 (DE-588)4293504-0 (DE-588)4141876-1 (DE-588)4200409-3 (DE-588)4001183-5 (DE-588)4135576-3 (DE-588)4138368-0 (DE-588)4116522-6 (DE-588)4132532-1 (DE-588)4240223-2 (DE-588)4026894-9 (DE-588)4047409-4 (DE-588)4011152-0 (DE-588)4076370-5 (DE-588)4125422-3 |
| title | Rzecz o istocie informatyki algorytmika |
| title_alt | Algorithmics |
| title_auth | Rzecz o istocie informatyki algorytmika |
| title_exact_search | Rzecz o istocie informatyki algorytmika |
| title_exact_search_txtP | Rzecz o istocie informatyki algorytmika |
| title_full | Rzecz o istocie informatyki algorytmika David Harel |
| title_fullStr | Rzecz o istocie informatyki algorytmika David Harel |
| title_full_unstemmed | Rzecz o istocie informatyki algorytmika David Harel |
| title_short | Rzecz o istocie informatyki |
| title_sort | rzecz o istocie informatyki algorytmika |
| title_sub | algorytmika |
| topic | Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmische Programmierung (DE-588)4293504-0 gnd Algorithmische Programmiersprache (DE-588)4141876-1 gnd Algorithmentheorie (DE-588)4200409-3 gnd Algorithmus (DE-588)4001183-5 gnd Programmverifikation (DE-588)4135576-3 gnd Berechenbarkeit (DE-588)4138368-0 gnd Softwareentwicklung (DE-588)4116522-6 gnd Beweis (DE-588)4132532-1 gnd Korrektheit (DE-588)4240223-2 gnd Informatik (DE-588)4026894-9 gnd Programmiersprache (DE-588)4047409-4 gnd Datenverarbeitung (DE-588)4011152-0 gnd Programmierung (DE-588)4076370-5 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd |
| topic_facet | Komplexitätstheorie Algorithmische Programmierung Algorithmische Programmiersprache Algorithmentheorie Algorithmus Programmverifikation Berechenbarkeit Softwareentwicklung Beweis Korrektheit Informatik Programmiersprache Datenverarbeitung Programmierung Effizienter Algorithmus |
| work_keys_str_mv | AT hareldavid algorithmics AT hareldavid rzeczoistocieinformatykialgorytmika |