The following pages link to Matthias Homeister (Q844145):
Displaying 10 items.
- Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance (Q844146) (← links)
- On approximation by \(^{\oplus}\)-OBDDs (Q845954) (← links)
- Lower bounds for restricted read-once parity branching programs (Q2503280) (← links)
- (Q3023944) (← links)
- (Q4779145) (← links)
- Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs (Q4800256) (← links)
- Quantum Computing verstehen (Q4922684) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431315) (← links)
- (Q5458817) (← links)
- (Q5702189) (← links)
