The following pages link to Detlef Sieling (Q210284):
Displaying 22 items.
- Parity OBDDs cannot be handled efficiently enough (Q293348) (← links)
- Graph driven BDDs -- a new data structure for Boolean functions (Q673788) (← links)
- Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs (Q1275068) (← links)
- Reduction of OBDDs in linear time (Q1313758) (← links)
- Binary decision diagrams in theory and practice (Q1606800) (← links)
- Lower bounds for linearly transformed OBDDs and FBDDs (Q1608325) (← links)
- The complexity of minimizing and learning OBDDs and FBDDs (Q1613429) (← links)
- Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
- New lower bounds and hierarchy results for restricted branching programs (Q1816743) (← links)
- The nonapproximability of OBDD minimization (Q1854498) (← links)
- Minimization problems for parity OBDDs (Q2272213) (← links)
- Minimization of decision trees is hard to approximate (Q2475411) (← links)
- A hierarchy result for read-once branching programs with restricted parity nondeterminism (Q2566039) (← links)
- (Q3081627) (← links)
- (Q4501682) (← links)
- (Q4536401) (← links)
- Derandomization (Q4571888) (← links)
- Variable orderings and the size of OBDDs for random partially symmetric Boolean functions (Q4705323) (← links)
- (Q4941907) (← links)
- (Q4946959) (← links)
- A separation of syntactic and nonsyntactic \((1,+k)\)-branching programs (Q5946705) (← links)
- A comparison of free BDDs and transformed BDDs (Q5949487) (← links)
