scientific article; zbMATH DE number 1500659
From MaRDI portal
Publication:4501681
Recommendations
- Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines.
- The power of nondeterminism and randomness for oblivious branching programs
- Very narrow quantum OBDDs and width hierarchies for classical OBDDs
- Nondeterministic unitary OBDDs
- Lower Bounds for Testing Computability by Small Width OBDDs
Cited in
(6)- Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines.
- Nondeterministic unitary OBDDs
- Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
- Testing Computability by Width Two OBDDs
- Very narrow quantum OBDDs and width hierarchies for classical OBDDs
- Output-size sensitiveness of OBDD construction through maximal independent set problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501681)
