Pages that link to "Item:Q845954"
From MaRDI portal
The following pages link to On approximation by \(^{\oplus}\)-OBDDs (Q845954):
Displaying 7 items.
- Approximating Boolean functions by OBDDs (Q867861) (← links)
- Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs (Q1275068) (← links)
- Introduction to the OBDD algorithm for the ATP community (Q1332638) (← links)
- Efficient Approximation of Well-Founded Justification and Well-Founded Domination (Q2851261) (← links)
- Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard (Q3591326) (← links)
- On the hardness of approximating the minimum consistent OBDD problem (Q5054808) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311101) (← links)