Pages that link to "Item:Q4593955"
From MaRDI portal
The following pages link to Read-once projections and formal circuit verification with binary decision diagrams (Q4593955):
Displaying 5 items.
- Approximating Boolean functions by OBDDs (Q867861) (← links)
- Completeness and non-completeness results with respect to read-once projections (Q1271310) (← links)
- A reducibility concept for problems defined in terms of ordered binary decision diagrams (Q1364133) (← links)
- Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication (Q2771493) (← links)
- A reducibility concept for problems defined in terms of ordered binary decision diagrams (Q5047173) (← links)