The following pages link to Unambiguity of circuits (Q1208408):
Displaying 10 items.
- Counting classes and the fine structure between \(\mathrm{NC}^1\) and \(L\) (Q764326) (← links)
- Positive and negative proofs for circuits and branching programs (Q896677) (← links)
- Unambiguous computations and locally definable acceptance types (Q1127545) (← links)
- Nondeterministic \(NC^1\) computation (Q1276170) (← links)
- Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
- Depth-first search in directed planar graphs, revisited (Q2170277) (← links)
- (Q3690754) (← links)
- An unambiguous class possessing a complete set (Q5048936) (← links)
- Parallel recognition and ranking of context-free languages (Q5096817) (← links)
- Advocating ownership (Q6567779) (← links)
