The complexity of classical and quantum branching programs: A communication complexity approach

Ablayev F.

The complexity of classical and quantum branching programs: A communication complexity approach

Ablayev F.

URI: https://dspace.kpfu.ru/xmlui/handle/net/133834

Date: 2005

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.

Show full item record

Files in this item

Name: SCOPUS03029743-20 ...

Size: 43.46Kb

Format: PDF

View/Open

This item appears in the following Collection(s)

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.