Combinatorial algorithms for subset sum problems:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Abschlussarbeit Buch |
Sprache: | English |
Veröffentlicht: |
Bochum
[2016]
|
Schlagworte: | |
Beschreibung: | vi, 122 Seiten |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV044290126 | ||
003 | DE-604 | ||
007 | t| | ||
008 | 170502s2016 xx m||| 00||| eng d | ||
035 | |a (DE-599)HBZHT018908838 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-355 | ||
100 | 1 | |a Ozerov, Ilya |d 1986- |e Verfasser |0 (DE-588)1038060605 |4 aut | |
245 | 1 | 0 | |a Combinatorial algorithms for subset sum problems |c vorgelegt von Ilya Ozerov |
264 | 1 | |a Bochum |c [2016] | |
300 | |a vi, 122 Seiten | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
502 | |b Dissertation |c Ruhr-Universität Bochum |d 2016 | ||
650 | 0 | 7 | |a Codierung |0 (DE-588)4070059-8 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Diskreter Logarithmus |0 (DE-588)4611135-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Post-Quantum-Kryptografie |0 (DE-588)7630202-7 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Kryptoanalyse |0 (DE-588)4830502-9 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Kryptoanalyse |0 (DE-588)4830502-9 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Post-Quantum-Kryptografie |0 (DE-588)7630202-7 |D s |
689 | 1 | |5 DE-604 | |
689 | 2 | 0 | |a Diskreter Logarithmus |0 (DE-588)4611135-9 |D s |
689 | 2 | |5 DE-604 | |
689 | 3 | 0 | |a Codierung |0 (DE-588)4070059-8 |D s |
689 | 3 | |5 DE-604 | |
689 | 4 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
689 | 4 | |5 DE-604 | |
776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |t Combinatorial algorithms for subset sum problems / Ilya Ozerov |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-029694246 |
Datensatz im Suchindex
_version_ | 1820232749450002432 |
---|---|
adam_text | |
any_adam_object | |
author | Ozerov, Ilya 1986- |
author_GND | (DE-588)1038060605 |
author_facet | Ozerov, Ilya 1986- |
author_role | aut |
author_sort | Ozerov, Ilya 1986- |
author_variant | i o io |
building | Verbundindex |
bvnumber | BV044290126 |
ctrlnum | (DE-599)HBZHT018908838 |
format | Thesis Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV044290126</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">170502s2016 xx m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)HBZHT018908838</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-355</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ozerov, Ilya</subfield><subfield code="d">1986-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1038060605</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorial algorithms for subset sum problems</subfield><subfield code="c">vorgelegt von Ilya Ozerov</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Bochum</subfield><subfield code="c">[2016]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">vi, 122 Seiten</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="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Ruhr-Universität Bochum</subfield><subfield code="d">2016</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Codierung</subfield><subfield code="0">(DE-588)4070059-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Diskreter Logarithmus</subfield><subfield code="0">(DE-588)4611135-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Post-Quantum-Kryptografie</subfield><subfield code="0">(DE-588)7630202-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Kryptoanalyse</subfield><subfield code="0">(DE-588)4830502-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kryptoanalyse</subfield><subfield code="0">(DE-588)4830502-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Post-Quantum-Kryptografie</subfield><subfield code="0">(DE-588)7630202-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Diskreter Logarithmus</subfield><subfield code="0">(DE-588)4611135-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Codierung</subfield><subfield code="0">(DE-588)4070059-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="t">Combinatorial algorithms for subset sum problems / Ilya Ozerov</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029694246</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV044290126 |
illustrated | Not Illustrated |
indexdate | 2025-01-03T13:00:22Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029694246 |
open_access_boolean | |
owner | DE-355 DE-BY-UBR |
owner_facet | DE-355 DE-BY-UBR |
physical | vi, 122 Seiten |
publishDate | 2016 |
publishDateSearch | 2016 |
publishDateSort | 2016 |
record_format | marc |
spelling | Ozerov, Ilya 1986- Verfasser (DE-588)1038060605 aut Combinatorial algorithms for subset sum problems vorgelegt von Ilya Ozerov Bochum [2016] vi, 122 Seiten txt rdacontent n rdamedia nc rdacarrier Dissertation Ruhr-Universität Bochum 2016 Codierung (DE-588)4070059-8 gnd rswk-swf Diskreter Logarithmus (DE-588)4611135-9 gnd rswk-swf Post-Quantum-Kryptografie (DE-588)7630202-7 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Kryptoanalyse (DE-588)4830502-9 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Kryptoanalyse (DE-588)4830502-9 s DE-604 Post-Quantum-Kryptografie (DE-588)7630202-7 s Diskreter Logarithmus (DE-588)4611135-9 s Codierung (DE-588)4070059-8 s Komplexitätstheorie (DE-588)4120591-1 s Erscheint auch als Online-Ausgabe Combinatorial algorithms for subset sum problems / Ilya Ozerov |
spellingShingle | Ozerov, Ilya 1986- Combinatorial algorithms for subset sum problems Codierung (DE-588)4070059-8 gnd Diskreter Logarithmus (DE-588)4611135-9 gnd Post-Quantum-Kryptografie (DE-588)7630202-7 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Kryptoanalyse (DE-588)4830502-9 gnd |
subject_GND | (DE-588)4070059-8 (DE-588)4611135-9 (DE-588)7630202-7 (DE-588)4120591-1 (DE-588)4830502-9 (DE-588)4113937-9 |
title | Combinatorial algorithms for subset sum problems |
title_auth | Combinatorial algorithms for subset sum problems |
title_exact_search | Combinatorial algorithms for subset sum problems |
title_full | Combinatorial algorithms for subset sum problems vorgelegt von Ilya Ozerov |
title_fullStr | Combinatorial algorithms for subset sum problems vorgelegt von Ilya Ozerov |
title_full_unstemmed | Combinatorial algorithms for subset sum problems vorgelegt von Ilya Ozerov |
title_short | Combinatorial algorithms for subset sum problems |
title_sort | combinatorial algorithms for subset sum problems |
topic | Codierung (DE-588)4070059-8 gnd Diskreter Logarithmus (DE-588)4611135-9 gnd Post-Quantum-Kryptografie (DE-588)7630202-7 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Kryptoanalyse (DE-588)4830502-9 gnd |
topic_facet | Codierung Diskreter Logarithmus Post-Quantum-Kryptografie Komplexitätstheorie Kryptoanalyse Hochschulschrift |
work_keys_str_mv | AT ozerovilya combinatorialalgorithmsforsubsetsumproblems |