Combining Boolean Gates and Branching Programs in One Model can Lead to Faster Circuits

2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) ◽

10.1109/ipdpsw.2017.39 ◽

2017 ◽

Cited By ~ 1

Author(s):

Yosi Ben-Asher ◽

Esti Stein ◽

Ramachandran Vaidyanathan

Keyword(s):

Branching Programs ◽

Boolean Gates

Download Full-text

Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 ◽

10.1145/12130.12131 ◽

1986 ◽

Cited By ~ 87

Author(s):

D A Barrington

Keyword(s):

Branching Programs ◽

Polynomial Size ◽

Bounded Width

Download Full-text

Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 ◽

10.1145/2897518.2897653 ◽

2016 ◽

Cited By ~ 20

Author(s):

Amir Abboud ◽

Thomas Dueholm Hansen ◽

Virginia Vassilevska Williams ◽

Ryan Williams

Keyword(s):

Lower Bound ◽

Edit Distance ◽

Branching Programs

Download Full-text

On Tseitin Formulas, Read-Once Branching Programs and Treewidth

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-030-19955-5_13 ◽

2019 ◽

pp. 143-155 ◽

Cited By ~ 1

Author(s):

Ludmila Glinskih ◽

Dmitry Itsykson

Keyword(s):

Branching Programs

Download Full-text

A Deterministic Algorithm for Testing the Equivalence of Read-Once Branching Programs with Small Discrepancy

Unveiling Dynamics and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-58741-7_13 ◽

2017 ◽

pp. 119-128

Author(s):

Stefan Arnold ◽

Jacobo Torán

Keyword(s):

Deterministic Algorithm ◽

Branching Programs ◽

Small Discrepancy

Download Full-text

Branching programs and binary decision diagrams

ACM SIGACT News ◽

10.1145/1855118.1855126 ◽

2010 ◽

Vol 41 (3) ◽

pp. 36-38

Author(s):

Samuel Johnson

Keyword(s):

Binary Decision Diagrams ◽

Decision Diagrams ◽

Branching Programs ◽

Binary Decision

Download Full-text

Discovering Boolean Gates in Slime Mould

Inspired by Nature - Emergence, Complexity and Computation ◽

10.1007/978-3-319-67997-6_15 ◽

2017 ◽

pp. 323-337 ◽

Cited By ~ 3

Author(s):

Simon Harding ◽

Jan Koutník ◽

Júrgen Schmidhuber ◽

Andrew Adamatzky

Keyword(s):

Slime Mould ◽

Boolean Gates

Download Full-text

On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs

Information and Computation ◽

10.1016/s0890-5401(02)93174-3 ◽

2002 ◽

Vol 178 (1) ◽

pp. 263-278 ◽

Cited By ~ 6

Author(s):

B Bollig

Keyword(s):

Boolean Functions ◽

Branching Programs

Download Full-text

A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs

Information Processing Letters ◽

10.1016/s0020-0190(02)00486-6 ◽

2003 ◽

Vol 86 (3) ◽

pp. 143-148 ◽

Cited By ~ 1

Author(s):

Beate Bollig

Keyword(s):

Simple Function ◽

Branching Programs ◽

Exponential Size

Download Full-text

A lower bound for read-once-only branching programs

Journal of Computer and System Sciences ◽

10.1016/0022-0000(87)90010-9 ◽

1987 ◽

Vol 35 (2) ◽

pp. 153-162 ◽

Cited By ~ 9

Author(s):

László Babai ◽

Péter Hajnal ◽

Endre Szemerédi ◽

György Turán

Keyword(s):

Lower Bound ◽

Branching Programs

Download Full-text

A characterization and nearly linear-time equivalence test forμ-branching programs

Theory of Computing Systems ◽

10.1007/bf02679462 ◽

1997 ◽

Vol 30 (3) ◽

pp. 249-283

Author(s):

V. Raghavan ◽

D. Wilkins

Keyword(s):

Linear Time ◽

Branching Programs ◽

Equivalence Test

Download Full-text