Pages that link to "Item:Q4462678"
From MaRDI portal
The following pages link to Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs (Q4462678):
Displaying 3 items.
- A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (Q1007589) (← links)
- Modified branching programs and their computational power (Q1187665) (← links)
- A hierarchy result for read-once branching programs with restricted parity nondeterminism (Q2566039) (← links)