PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Bollig, Beate"

Author of the publication

copydeleteadd this publication to your clipboard
On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs.

, , and . Computational Complexity Conference, page 172-183. IEEE Computer Society, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Beate Kaebel University of Stuttgart

Beate Holley University of Stuttgart

Beate Koch University of Stuttgart

Beate Britz University of Stuttgart

Beate Langer University of Stuttgart

 

Other publications of authors with the same name

On the Minimization of (Complete) Ordered Binary Decision Diagrams.. Theory Comput. Syst., 59 (3): 532-559 (2016)Komplexitätsanalysen für BDD-artige Datenstrukturen.. Technical University of Dortmund, Germany, (1998)On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem.. SOFSEM, volume 5404 of Lecture Notes in Computer Science, page 129-140. Springer, (2009)Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size., and . SOFSEM, volume 6543 of Lecture Notes in Computer Science, page 135-145. Springer, (2011)On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem.. COCOA (2), volume 6509 of Lecture Notes in Computer Science, page 16-30. Springer, (2010)Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication, , and . Electronic Colloquium on Computational Complexity (ECCC), (2001)A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs. Electronic Colloquium on Computational Complexity (ECCC), (2002)On the Power of Different Types of Restricted Branching Programs, , , and . Electronic Colloquium on Computational Complexity (ECCC), (1994)New Results on the Most Significant Bit of Integer Multiplication., and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 883-894. Springer, (2008)On the Complexity of Some Ordering Problems.. MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 118-129. Springer, (2014)