Quantum branching programs (quantum binary decision diagrams, respectively) are a convenient tool for examining quantum computations using only a logarithmic amount of space. Recently several typesâ€¦ (More)

Acknowledgements I would like to acknowledge all the people whose support gave me the possibility to undergo the work of this thesis. First of all, I would like to express my thanks to my Advisorâ€¦ (More)

We prove the first lower bound for restricted readâ€“once parity branching programs with unlimited parity nondeterminism where for each input the variables may be tested according to several orderings.â€¦ (More)

We investigate well-structured graph-driven parity-FBDDs, which strictly generalize the two well-known models parity OBDDs and well-structured graph-driven FBDDs. The first main result is aâ€¦ (More)

The usual OBDD-data structure can easily be equipped with nondeterminism by allowing several edges with the same label leaving a node. Depending on how acceptance is defined we distinguish betweenâ€¦ (More)

We prove the first lower bounds for restricted readâ€“once parity branching programs with unlimited parity nondeterminism where for each input the variables may be tested according to severalâ€¦ (More)