dc.contributor.author |
Ablayev F. |
|
dc.contributor.author |
Vasiliev A. |
|
dc.date.accessioned |
2018-09-18T20:08:22Z |
|
dc.date.available |
2018-09-18T20:08:22Z |
|
dc.date.issued |
2014 |
|
dc.identifier.issn |
0302-9743 |
|
dc.identifier.uri |
https://dspace.kpfu.ru/xmlui/handle/net/136894 |
|
dc.description.abstract |
© Springer International Publishing Switzerland 2014. In this paper we show a computational aspect of the quantum hashing technique. In particular we apply it for computing Boolean functions in the model of read-once quantum branching programs based on the properties of specific polynomial presentation of those functions. |
|
dc.relation.ispartofseries |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|
dc.title |
Computing boolean functions via quantum hashing |
|
dc.type |
Article |
|
dc.relation.ispartofseries-volume |
8808 |
|
dc.collection |
Публикации сотрудников КФУ |
|
dc.relation.startpage |
149 |
|
dc.source.id |
SCOPUS03029743-2014-8808-SID84916937293 |
|