Kazan Federal University Digital Repository
The complexity of classical and quantum branching programs: A communication complexity approach
- Home
- →
- Научные публикации в Scopus
- →
- Публикации сотрудников КФУ Scopus
- →
- View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Ablayev F. | |
| dc.date.accessioned | 2018-09-17T20:39:21Z | |
| dc.date.available | 2018-09-17T20:39:21Z | |
| dc.date.issued | 2005 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/133834 | |
| dc.description.abstract | We present a survey of the communication point of view for a complexity lower bounds proof technique for classical (deterministic, nondeterministic and randomized) and quantum models of branching programs. © Springer-Verlag Berlin Heidelberg 2005. | |
| dc.relation.ispartofseries | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |
| dc.subject | Branching programs | |
| dc.subject | Communication computations | |
| dc.subject | Quantum computations | |
| dc.title | The complexity of classical and quantum branching programs: A communication complexity approach | |
| dc.type | Conference Paper | |
| dc.relation.ispartofseries-volume | 3777 LNCS | |
| dc.collection | Публикации сотрудников КФУ | |
| dc.relation.startpage | 190 | |
| dc.source.id | SCOPUS03029743-2005-3777-SID33646755213 |
Files in this item
This item appears in the following Collection(s)
-
Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.