The complexity of generating and checking proofs of membership:
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Ulm
Univ. Ulm, Fak. für Informatik
1995
|
Schriftenreihe: | Ulmer Informatik-Berichte
1995,3 |
Beschreibung: | 22 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010148121 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 950420s1995 |||| 00||| eng d | ||
035 | |a (OCoLC)75552860 | ||
035 | |a (DE-599)BVBBV010148121 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T |a DE-12 | ||
100 | 1 | |a Buhrman, Harry |e Verfasser |4 aut | |
245 | 1 | 0 | |a The complexity of generating and checking proofs of membership |c Harry Buhrman ; Thomas Thierauf |
264 | 1 | |a Ulm |b Univ. Ulm, Fak. für Informatik |c 1995 | |
300 | |a 22 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Ulmer Informatik-Berichte |v 1995,3 | |
700 | 1 | |a Thierauf, Thomas |e Verfasser |4 aut | |
830 | 0 | |a Ulmer Informatik-Berichte |v 1995,3 |w (DE-604)BV004515570 |9 1995,3 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006740216 |
Datensatz im Suchindex
_version_ | 1804124542849777664 |
---|---|
any_adam_object | |
author | Buhrman, Harry Thierauf, Thomas |
author_facet | Buhrman, Harry Thierauf, Thomas |
author_role | aut aut |
author_sort | Buhrman, Harry |
author_variant | h b hb t t tt |
building | Verbundindex |
bvnumber | BV010148121 |
ctrlnum | (OCoLC)75552860 (DE-599)BVBBV010148121 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00888nam a2200277 cb4500</leader><controlfield tag="001">BV010148121</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950420s1995 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)75552860</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010148121</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><subfield code="a">DE-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Buhrman, Harry</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The complexity of generating and checking proofs of membership</subfield><subfield code="c">Harry Buhrman ; Thomas Thierauf</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ulm</subfield><subfield code="b">Univ. Ulm, Fak. für Informatik</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">22 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">Ulmer Informatik-Berichte</subfield><subfield code="v">1995,3</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Thierauf, Thomas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Ulmer Informatik-Berichte</subfield><subfield code="v">1995,3</subfield><subfield code="w">(DE-604)BV004515570</subfield><subfield code="9">1995,3</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006740216</subfield></datafield></record></collection> |
id | DE-604.BV010148121 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:47:20Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006740216 |
oclc_num | 75552860 |
open_access_boolean | |
owner | DE-29T DE-12 |
owner_facet | DE-29T DE-12 |
physical | 22 S. |
publishDate | 1995 |
publishDateSearch | 1995 |
publishDateSort | 1995 |
publisher | Univ. Ulm, Fak. für Informatik |
record_format | marc |
series | Ulmer Informatik-Berichte |
series2 | Ulmer Informatik-Berichte |
spelling | Buhrman, Harry Verfasser aut The complexity of generating and checking proofs of membership Harry Buhrman ; Thomas Thierauf Ulm Univ. Ulm, Fak. für Informatik 1995 22 S. txt rdacontent n rdamedia nc rdacarrier Ulmer Informatik-Berichte 1995,3 Thierauf, Thomas Verfasser aut Ulmer Informatik-Berichte 1995,3 (DE-604)BV004515570 1995,3 |
spellingShingle | Buhrman, Harry Thierauf, Thomas The complexity of generating and checking proofs of membership Ulmer Informatik-Berichte |
title | The complexity of generating and checking proofs of membership |
title_auth | The complexity of generating and checking proofs of membership |
title_exact_search | The complexity of generating and checking proofs of membership |
title_full | The complexity of generating and checking proofs of membership Harry Buhrman ; Thomas Thierauf |
title_fullStr | The complexity of generating and checking proofs of membership Harry Buhrman ; Thomas Thierauf |
title_full_unstemmed | The complexity of generating and checking proofs of membership Harry Buhrman ; Thomas Thierauf |
title_short | The complexity of generating and checking proofs of membership |
title_sort | the complexity of generating and checking proofs of membership |
volume_link | (DE-604)BV004515570 |
work_keys_str_mv | AT buhrmanharry thecomplexityofgeneratingandcheckingproofsofmembership AT thieraufthomas thecomplexityofgeneratingandcheckingproofsofmembership |