Pages that link to "Item:Q4362278"
From MaRDI portal
The following pages link to A note on read-$k$ times branching programs (Q4362278):
Displaying 26 items.
- A simple function that requires exponential size read-once branching programs (Q287023) (← links)
- On the read-once property of branching programs and CNFs of bounded treewidth (Q309788) (← links)
- Limitations of incremental dynamic programming (Q517805) (← links)
- Yet harder knapsack problems (Q653327) (← links)
- Incremental branching programs (Q929291) (← links)
- A nondeterministic space-time tradeoff for linear codes (Q976097) (← links)
- Neither reading few bits twice nor reading illegally helps much (Q1130185) (← links)
- A lower bound on branching programs reading some bits twice (Q1392030) (← links)
- Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
- On uncertainty versus size in branching programs. (Q1401198) (← links)
- A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs (Q1575258) (← links)
- Time-space tradeoffs for branching programs (Q1604208) (← links)
- Linear codes are hard for oblivious read-once parity branching programs (Q1606909) (← links)
- Lower bounds for linearly transformed OBDDs and FBDDs (Q1608325) (← links)
- Satisfiability algorithm for syntactic read-\(k\)-times branching programs (Q2032296) (← links)
- On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs (Q2361671) (← links)
- On lower bounds for read-\(k\)-times branching programs (Q2366719) (← links)
- Expanders and time-restricted branching programs (Q2378527) (← links)
- Comparing the sizes of nondeterministic branching read-k-times programs (Q4268146) (← links)
- (Q4471998) (← links)
- (Q4542589) (← links)
- On the hierarchy of nondeterministic branching k-programs (Q5055950) (← links)
- Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. (Q5111240) (← links)
- (Q5121903) (← links)
- Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs (Q5136279) (← links)
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems (Q5929919) (← links)
