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

2017 ◽  
Author(s):  
Yosi Ben-Asher ◽  
Esti Stein ◽  
Ramachandran Vaidyanathan
Keyword(s):  
Branching Programs ◽  
Boolean Gates

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

2016 ◽  
Author(s):  
Amir Abboud ◽  
Thomas Dueholm Hansen ◽  
Virginia Vassilevska Williams ◽  
Ryan Williams
Keyword(s):  
Lower Bound ◽  
Edit Distance ◽  
Branching Programs

On Tseitin Formulas, Read-Once Branching Programs and Treewidth

2019 ◽  
pp. 143-155 ◽  
Author(s):  
Ludmila Glinskih ◽  
Dmitry Itsykson
Keyword(s):  
Branching Programs

Branching programs and binary decision diagrams

2010 ◽  
Vol 41 (3) ◽  
pp. 36-38
Author(s):  
Samuel Johnson
Keyword(s):  
Binary Decision Diagrams ◽  
Decision Diagrams ◽  
Branching Programs ◽  
Binary Decision

scholarly journals Discovering Boolean Gates in Slime Mould

2017 ◽  
pp. 323-337 ◽  
Author(s):  
Simon Harding ◽  
Jan Koutník ◽  
Júrgen Schmidhuber ◽  
Andrew Adamatzky
Keyword(s):  
Slime Mould ◽  
Boolean Gates

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

2002 ◽  
Vol 178 (1) ◽  
pp. 263-278 ◽  
Author(s):  
B Bollig
Keyword(s):  
Boolean Functions ◽  
Branching Programs

scholarly journals A lower bound for read-once-only branching programs

1987 ◽  
Vol 35 (2) ◽  
pp. 153-162 ◽  
Author(s):  
László Babai ◽  
Péter Hajnal ◽  
Endre Szemerédi ◽  
György Turán
Keyword(s):  
Lower Bound ◽  
Branching Programs

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

1997 ◽  
Vol 30 (3) ◽  
pp. 249-283
Author(s):  
V. Raghavan ◽  
D. Wilkins
Keyword(s):  
Linear Time ◽  
Branching Programs ◽  
Equivalence Test
Sign in / Sign up

Export Citation Format

Share Document