Lower bounds for the complexity of functions in random access machines:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Haifa, Israel
1989
|
| Schriftenreihe: | haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report
583 |
| Beschreibung: | 11 Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010513700 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951206s1989 |||| 00||| undod | ||
| 035 | |a (OCoLC)633380922 | ||
| 035 | |a (DE-599)BVBBV010513700 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-91G | ||
| 100 | 1 | |a Bshouty, Nader H. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Lower bounds for the complexity of functions in random access machines |
| 264 | 1 | |a Haifa, Israel |c 1989 | |
| 300 | |a 11 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report |v 583 | |
| 810 | 2 | |a Department of Computer Science: Technical report |t <<haṭ->> Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> |v 583 |w (DE-604)BV010499135 |9 583 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007007558 | ||
Datensatz im Suchindex
| _version_ | 1804124980152107008 |
|---|---|
| any_adam_object | |
| author | Bshouty, Nader H. |
| author_facet | Bshouty, Nader H. |
| author_role | aut |
| author_sort | Bshouty, Nader H. |
| author_variant | n h b nh nhb |
| building | Verbundindex |
| bvnumber | BV010513700 |
| ctrlnum | (OCoLC)633380922 (DE-599)BVBBV010513700 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00985nam a2200265 cb4500</leader><controlfield tag="001">BV010513700</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951206s1989 |||| 00||| undod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)633380922</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010513700</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bshouty, Nader H.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Lower bounds for the complexity of functions in random access machines</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Haifa, Israel</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">11 Bl.</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">haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report</subfield><subfield code="v">583</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t"><<haṭ->> Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā></subfield><subfield code="v">583</subfield><subfield code="w">(DE-604)BV010499135</subfield><subfield code="9">583</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007007558</subfield></datafield></record></collection> |
| id | DE-604.BV010513700 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:54:17Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007007558 |
| oclc_num | 633380922 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 11 Bl. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series2 | haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report |
| spelling | Bshouty, Nader H. Verfasser aut Lower bounds for the complexity of functions in random access machines Haifa, Israel 1989 11 Bl. txt rdacontent n rdamedia nc rdacarrier haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report 583 Department of Computer Science: Technical report <<haṭ->> Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> 583 (DE-604)BV010499135 583 |
| spellingShingle | Bshouty, Nader H. Lower bounds for the complexity of functions in random access machines |
| title | Lower bounds for the complexity of functions in random access machines |
| title_auth | Lower bounds for the complexity of functions in random access machines |
| title_exact_search | Lower bounds for the complexity of functions in random access machines |
| title_full | Lower bounds for the complexity of functions in random access machines |
| title_fullStr | Lower bounds for the complexity of functions in random access machines |
| title_full_unstemmed | Lower bounds for the complexity of functions in random access machines |
| title_short | Lower bounds for the complexity of functions in random access machines |
| title_sort | lower bounds for the complexity of functions in random access machines |
| volume_link | (DE-604)BV010499135 |
| work_keys_str_mv | AT bshoutynaderh lowerboundsforthecomplexityoffunctionsinrandomaccessmachines |