SUBQUADRATIC SIMULATIONS OF CIRCUITS BY BRANCHING PROGRAMS

被引：5

|

作者：

CAI, JY

LIPTON, RJ

机构：

来源：

30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE | 1989年

关键词：

D O I：

10.1109/SFCS.1989.63536

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

收藏

页码：568 / 573

页数：6

相关论文

共 50 条

[1] SUBQUADRATIC SIMULATIONS OF BALANCED FORMULAS BY BRANCHING PROGRAMS
CAI, JY
LIPTON, RJ
SIAM JOURNAL ON COMPUTING, 1994, 23 (03) : 563 - 572
[2] Positive and Negative Proofs for Circuits and Branching Programs
Dorzweiler, Olga
Flamm, Thomas
Krebs, Andreas
Ludwig, Michael
DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014, 2014, 8614 : 270 - 281
[3] Positive and negative proofs for circuits and branching programs
Dorzweiler, Olga
Flamm, Thomas
Krebs, Andreas
Ludwig, Michael
THEORETICAL COMPUTER SCIENCE, 2016, 610 : 24 - 36
[4] Efficient Conversion of Boolean Circuits to Nondeterministic Branching Programs
Ben Asher, Yosi
Tartakovsky, Vladislav
2019 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2019, : 655 - 662
[5] BRANCHING PROGRAMS PROVIDE LOWER BOUNDS ON THE AREA OF VLSI CIRCUITS
HROMKOVIC, J
KYBERNETIKA, 1991, 27 (06) : 542 - 550
[6] The isomorphism problem for read-once branching programs and arithmetic circuits
Thierauf, T
CHICAGO JOURNAL OF THEORETICAL COMPUTER SCIENCE, 1998, (01): : 1 - 23
[7] BRANCHING PROGRAMS VERSUS OBLIVIOUS BRANCHING PROGRAMS
HROMKOVIC, J
COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1991, 10 (01): : 67 - 74
[8] Functions computable by Boolean circuits of logarithmic depth and branching programs of a special type
Vasiliev A.V.
Journal of Applied and Industrial Mathematics, 2008, 2 (4) : 585 - 590
[9] Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
Jansen, Maurice
Rao, Raghavendra B., V
COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2009, 5675 : 179 - +
[10] Branching programs
不详
COMPUTATIONAL COMPLEXITY OF EQUIVALENCE AND ISOMORPHISM PROBLEMS, 2000, 1852 : 65 - 120

← 1 2 3 4 5 →