Pages that link to "Item:Q4268146"
From MaRDI portal
The following pages link to Comparing the sizes of nondeterministic branching read-k-times programs (Q4268146):
Displaying 4 items.
- A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (Q1007589) (← links)
- The power of nondeterminism in polynomial-size bounded-width branching programs (Q1116338) (← links)
- On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs (Q2361671) (← links)
- (Q4542589) (← links)