Pages that link to "Item:Q2366719"
From MaRDI portal
The following pages link to On lower bounds for read-\(k\)-times branching programs (Q2366719):
Displayed 28 items.
- Incremental branching programs (Q929291) (← links)
- Neither reading few bits twice nor reading illegally helps much (Q1130185) (← links)
- Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs (Q1275068) (← links)
- Efficient oblivious branching programs for threshold and mod functions (Q1384527) (← links)
- A lower bound on branching programs reading some bits twice (Q1392030) (← links)
- Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
- A lower bound for integer multiplication on randomized ordered read-once branching programs. (Q1426006) (← links)
- BDDs -- design, analysis, complexity, and applications. (Q1428568) (← links)
- A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs (Q1575258) (← links)
- Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity (Q1604200) (← links)
- Time-space tradeoffs for branching programs (Q1604208) (← links)
- On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs (Q1854567) (← links)
- On multi-partition communication complexity (Q1886038) (← links)
- Top-down lower bounds for depth-three circuits (Q1904663) (← links)
- On arithmetic branching programs (Q1961372) (← links)
- Expanders and time-restricted branching programs (Q2378527) (← links)
- Lower bounds for restricted read-once parity branching programs (Q2503280) (← links)
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (Q2508966) (← links)
- A hierarchy result for read-once branching programs with restricted parity nondeterminism (Q2566039) (← links)
- On the computational power of probabilistic and quantum branching program (Q2581534) (← links)
- A very simple function that requires exponential size read-once branching programs. (Q2583538) (← links)
- Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication (Q2771493) (← links)
- Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae (Q3599149) (← links)
- Communication Complexity and Lower Bounds on Multilective Computations (Q4265538) (← links)
- Comparing the sizes of nondeterministic branching read-k-times programs (Q4268146) (← links)
- A note on read-$k$ times branching programs (Q4362278) (← links)
- Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs (Q4462678) (← links)
- On BPP versus \(NP\cup coNP\) for ordered read-once branching programs (Q5941564) (← links)