Pages that link to "Item:Q2272213"
From MaRDI portal
The following pages link to Minimization problems for parity OBDDs (Q2272213):
Displaying 7 items.
- Parity OBDDs cannot be handled efficiently enough (Q293348) (← links)
- On approximation by \(^{\oplus}\)-OBDDs (Q845954) (← links)
- On the descriptive and algorithmic power of parity ordered binary decision diagrams (Q1854421) (← links)
- Single-faced Boolean functions and their minimization (Q2765227) (← links)
- On random orderings of variables for parity ordered binary decision diagrams (Q4487092) (← links)
- On the hardness of approximating the minimum consistent OBDD problem (Q5054808) (← links)
- OBDDs of a monotone function and of its prime implicants (Q6487433) (← links)