Lower bounds for probabilistic space complexity: automata approach
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Rochester, NY
1992
|
| Schriftenreihe: | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report
423 |
| Schlagworte: | |
| Beschreibung: | 13 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009015687 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27652925 | ||
| 035 | |a (DE-599)BVBBV009015687 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Ablajev, Farid |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Lower bounds for probabilistic space complexity |b automata approach |c Farid Ablayev |
| 264 | 1 | |a Rochester, NY |c 1992 | |
| 300 | |a 13 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |v 423 | |
| 650 | 4 | |a Turing machines | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Rochester <Rochester, NY> |v 423 |w (DE-604)BV008902697 |9 423 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005961234 | ||
Datensatz im Suchindex
| _version_ | 1804123365016862720 |
|---|---|
| any_adam_object | |
| author | Ablajev, Farid |
| author_facet | Ablajev, Farid |
| author_role | aut |
| author_sort | Ablajev, Farid |
| author_variant | f a fa |
| building | Verbundindex |
| bvnumber | BV009015687 |
| ctrlnum | (OCoLC)27652925 (DE-599)BVBBV009015687 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00943nam a2200277 cb4500</leader><controlfield tag="001">BV009015687</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27652925</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009015687</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ablajev, Farid</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 probabilistic space complexity</subfield><subfield code="b">automata approach</subfield><subfield code="c">Farid Ablayev</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Rochester, NY</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 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">University of Rochester <Rochester, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">423</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Turing machines</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">University of Rochester <Rochester, NY></subfield><subfield code="v">423</subfield><subfield code="w">(DE-604)BV008902697</subfield><subfield code="9">423</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005961234</subfield></datafield></record></collection> |
| id | DE-604.BV009015687 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005961234 |
| oclc_num | 27652925 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 13 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |
| spelling | Ablajev, Farid Verfasser aut Lower bounds for probabilistic space complexity automata approach Farid Ablayev Rochester, NY 1992 13 S. txt rdacontent n rdamedia nc rdacarrier University of Rochester <Rochester, NY> / Department of Computer Science: Technical report 423 Turing machines Department of Computer Science: Technical report University of Rochester <Rochester, NY> 423 (DE-604)BV008902697 423 |
| spellingShingle | Ablajev, Farid Lower bounds for probabilistic space complexity automata approach Turing machines |
| title | Lower bounds for probabilistic space complexity automata approach |
| title_auth | Lower bounds for probabilistic space complexity automata approach |
| title_exact_search | Lower bounds for probabilistic space complexity automata approach |
| title_full | Lower bounds for probabilistic space complexity automata approach Farid Ablayev |
| title_fullStr | Lower bounds for probabilistic space complexity automata approach Farid Ablayev |
| title_full_unstemmed | Lower bounds for probabilistic space complexity automata approach Farid Ablayev |
| title_short | Lower bounds for probabilistic space complexity |
| title_sort | lower bounds for probabilistic space complexity automata approach |
| title_sub | automata approach |
| topic | Turing machines |
| topic_facet | Turing machines |
| volume_link | (DE-604)BV008902697 |
| work_keys_str_mv | AT ablajevfarid lowerboundsforprobabilisticspacecomplexityautomataapproach |