The following pages link to (Q4258580):
Displayed 4 items.
- On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata (Q596324) (← links)
- Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (Q1401957) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- The communication complexity of pointer chasing (Q5943092) (← links)