Pages that link to "Item:Q1107323"
From MaRDI portal
The following pages link to A lower bound for read-once-only branching programs (Q1107323):
Displayed 10 items.
- A simple function that requires exponential size read-once branching programs (Q287023) (← links)
- On the size of binary decision diagrams representing Boolean functions (Q673087) (← links)
- Neither reading few bits twice nor reading illegally helps much (Q1130185) (← links)
- A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs (Q1575258) (← links)
- Time-space tradeoffs for branching programs (Q1604208) (← links)
- On lower bounds for read-\(k\)-times branching programs (Q2366719) (← links)
- (Q4009550) (← links)
- On the hierarchy of nondeterministic branching k-programs (Q5055950) (← links)
- Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. (Q5111240) (← links)
- Paradigms for Unconditional Pseudorandom Generators (Q6149335) (← links)