Pages that link to "Item:Q1604208"

The following pages link to Time-space tradeoffs for branching programs (Q1604208):

Displaying 21 items.

• Totally optimal decision trees for Boolean functions (Q323025) (← links)
• Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice (Q841618) (← links)
• A note on the decoding complexity of error-correcting codes (Q845843) (← links)
• Incremental branching programs (Q929291) (← links)
• A nondeterministic space-time tradeoff for linear codes (Q976097) (← links)
• Choice-memory tradeoff in allocations (Q990388) (← links)
• Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
• BDDs -- design, analysis, complexity, and applications. (Q1428568) (← links)
• Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
• On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs (Q1854567) (← links)
• On multi-partition communication complexity (Q1886038) (← links)
• Satisfiability algorithm for syntactic read-\(k\)-times branching programs (Q2032296) (← links)
• Expanders and time-restricted branching programs (Q2378527) (← 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)
• Time and space complexity of deterministic and nondeterministic decision trees (Q2679423) (← links)
• Finding the Median (Obliviously) with Bounded Space (Q3448777) (← links)
• Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle (Q5090435) (← links)
• (Q5121903) (← links)
• Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs (Q5136279) (← links)
• Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)