Pages that link to "Item:Q3976028"
From MaRDI portal
The following pages link to Restricted branching programs and their computational power (Q3976028):
Displaying 5 items.
- On the size of binary decision diagrams representing Boolean functions (Q673087) (← links)
- A characterization and nearly linear-time equivalence test for \(\mu\)-branching programs (Q679436) (← links)
- Polynomial size \(\Omega\)-branching programs and their computational power (Q918199) (← links)
- Reduced error pruning of branching programs cannot be approximated to within a logarithmic factor (Q1014397) (← links)
- Modified branching programs and their computational power (Q1187665) (← links)