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

被引：0
作者：
Ablayev, F [1 ]
机构：
[1] Kazan VI Lenin State Univ, Dept Theoret Cybernet, Kazan 420008, Russia
来源：
STOCHASTIC ALGORITHMS: FOUNDATIONS AND APPLICATIONS, PROCEEDINGS | 2005年 / 3777卷
关键词：
branching programs; communication computations; quantum computations;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：190 / 201
页数：12
相关论文
共 7 条
1