An exponential lower bound on the complexity of the cryptographic knapsack problem:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Kingston, Ontario, Canada
1982
|
| Schriftenreihe: | Queen's University <Kingston, Ontario> / Department of Computing and Information Science: Technical report
137 |
| Beschreibung: | 12 Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010021081 | ||
| 003 | DE-604 | ||
| 005 | 19950201 | ||
| 007 | t | ||
| 008 | 950201s1982 |||| 00||| engod | ||
| 035 | |a (OCoLC)35386488 | ||
| 035 | |a (DE-599)BVBBV010021081 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Meijer, Henk |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An exponential lower bound on the complexity of the cryptographic knapsack problem |
| 264 | 1 | |a Kingston, Ontario, Canada |c 1982 | |
| 300 | |a 12 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Queen's University <Kingston, Ontario> / Department of Computing and Information Science: Technical report |v 137 | |
| 810 | 2 | |a Department of Computing and Information Science: Technical report |t Queen's University <Kingston, Ontario> |v 137 |w (DE-604)BV010020284 |9 137 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006643822 | ||
Datensatz im Suchindex
| _version_ | 1804124400376610816 |
|---|---|
| any_adam_object | |
| author | Meijer, Henk |
| author_facet | Meijer, Henk |
| author_role | aut |
| author_sort | Meijer, Henk |
| author_variant | h m hm |
| building | Verbundindex |
| bvnumber | BV010021081 |
| ctrlnum | (OCoLC)35386488 (DE-599)BVBBV010021081 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00936nam a2200253 cb4500</leader><controlfield tag="001">BV010021081</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19950201 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950201s1982 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35386488</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010021081</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="100" ind1="1" ind2=" "><subfield code="a">Meijer, Henk</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An exponential lower bound on the complexity of the cryptographic knapsack problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Kingston, Ontario, Canada</subfield><subfield code="c">1982</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 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">Queen's University <Kingston, Ontario> / Department of Computing and Information Science: Technical report</subfield><subfield code="v">137</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computing and Information Science: Technical report</subfield><subfield code="t">Queen's University <Kingston, Ontario></subfield><subfield code="v">137</subfield><subfield code="w">(DE-604)BV010020284</subfield><subfield code="9">137</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006643822</subfield></datafield></record></collection> |
| id | DE-604.BV010021081 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:45:04Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006643822 |
| oclc_num | 35386488 |
| open_access_boolean | |
| physical | 12 Bl. |
| publishDate | 1982 |
| publishDateSearch | 1982 |
| publishDateSort | 1982 |
| record_format | marc |
| series2 | Queen's University <Kingston, Ontario> / Department of Computing and Information Science: Technical report |
| spelling | Meijer, Henk Verfasser aut An exponential lower bound on the complexity of the cryptographic knapsack problem Kingston, Ontario, Canada 1982 12 Bl. txt rdacontent n rdamedia nc rdacarrier Queen's University <Kingston, Ontario> / Department of Computing and Information Science: Technical report 137 Department of Computing and Information Science: Technical report Queen's University <Kingston, Ontario> 137 (DE-604)BV010020284 137 |
| spellingShingle | Meijer, Henk An exponential lower bound on the complexity of the cryptographic knapsack problem |
| title | An exponential lower bound on the complexity of the cryptographic knapsack problem |
| title_auth | An exponential lower bound on the complexity of the cryptographic knapsack problem |
| title_exact_search | An exponential lower bound on the complexity of the cryptographic knapsack problem |
| title_full | An exponential lower bound on the complexity of the cryptographic knapsack problem |
| title_fullStr | An exponential lower bound on the complexity of the cryptographic knapsack problem |
| title_full_unstemmed | An exponential lower bound on the complexity of the cryptographic knapsack problem |
| title_short | An exponential lower bound on the complexity of the cryptographic knapsack problem |
| title_sort | an exponential lower bound on the complexity of the cryptographic knapsack problem |
| volume_link | (DE-604)BV010020284 |
| work_keys_str_mv | AT meijerhenk anexponentiallowerboundonthecomplexityofthecryptographicknapsackproblem |