LOWER BOUNDS FOR DETERMINISTIC AND NONDETERMINISTIC BRANCHING PROGRAMS

被引：0

作者：

RAZBOROV, AA

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1991年 / 529卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We survey lower bounds established for the complexity of computing explicitly given Boolean functions by switching-and-rectifier networks, branching programs and switching networks. We first consider the unrestricted case and then proceed to various restricted models. Among these are monotone networks, bounded-width devices*, oblivious devices and read-k times only devices.

引用

页码：47 / 60

页数：14

共 50 条

[1] BRANCHING PROGRAMS PROVIDE LOWER BOUNDS ON THE AREAS OF MULTILECTIVE DETERMINISTIC AND NONDETERMINISTIC VLSI-CIRCUITS
HROMKOVIC, J
KRAUSE, M
MEINEL, C
WAACK, S
INFORMATION AND COMPUTATION, 1992, 96 (02) : 168 - 178
[2] Unitary Branching Programs: Learnability and Lower Bounds
Diaz Andino, Fidel Ernesto
Kokkou, Maria
Oliveira, Mateus de Oliveira
Vadiee, Farhad
INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
[3] On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-k-times branching programs
Khadiev K.
Lobachevskii Journal of Mathematics, 2016, 37 (6) : 683 - 704
[4] Lower bounds for syntactically multilinear algebraic branching programs
Jansen, Maurice J.
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2008, PROCEEDINGS, 2008, 5162 : 407 - 418
[5] Quadratic Lower Bounds for Algebraic Branching Programs and Formulas
Prerona Chatterjee
Mrinal Kumar
Adrian She
Ben Lee Volk
computational complexity, 2022, 31
[6] QUADRATIC LOWER BOUNDS FOR ALGEBRAIC BRANCHING PROGRAMS AND FORMULAS
Chatterjee, Prerona
Kumar, Mrinal
She, Adrian
Volk, Ben Lee
COMPUTATIONAL COMPLEXITY, 2022, 31 (02)
[7] Lower bounds for depth-restricted branching programs
Krause, Matthias, 1600, (91):
[8] LOWER BOUNDS FOR DEPTH-RESTRICTED BRANCHING PROGRAMS
KRAUSE, M
INFORMATION AND COMPUTATION, 1991, 91 (01) : 1 - 14
[9] LOWER BOUNDS ON THE COMPLEXITY OF ONE TIME ONLY BRANCHING PROGRAMS
DUNNE, PE
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 90 - 99
[10] BRANCHING PROGRAMS PROVIDE LOWER BOUNDS ON THE AREA OF VLSI CIRCUITS
HROMKOVIC, J
KYBERNETIKA, 1991, 27 (06) : 542 - 550

← 1 2 3 4 5 →