Pages that link to "Item:Q1178711"
From MaRDI portal
The following pages link to Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) (Q1178711):
Displayed 18 items.
- A simple function that requires exponential size read-once branching programs (Q287023) (← links)
- On the size of (generalized) OBDDs for threshold functions (Q987805) (← links)
- A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (Q1007589) (← links)
- Neither reading few bits twice nor reading illegally helps much (Q1130185) (← links)
- Separating complexity classes related to \(\Omega\)-decision trees (Q1202936) (← links)
- Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
- Almost \(k\)-wise independence and hard Boolean functions. (Q1401305) (← links)
- Exponential space complexity for OBDD-based reachability analysis (Q1675755) (← links)
- Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
- On lower bounds for read-\(k\)-times branching programs (Q2366719) (← links)
- Nondeterministic unitary OBDDs (Q2399370) (← links)
- Reordering method and hierarchies for quantum and classical ordered binary decision diagrams (Q2399372) (← links)
- A hierarchy result for read-once branching programs with restricted parity nondeterminism (Q2566039) (← links)
- A very simple function that requires exponential size read-once branching programs. (Q2583538) (← links)
- On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem (Q3599068) (← links)
- Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines (Q4020492) (← links)
- A note on read-$k$ times branching programs (Q4362278) (← links)
- On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width (Q5302060) (← links)