Pages that link to "Item:Q4032302"

The following pages link to Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access (Q4032302):

Displayed 2 items.

• On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs (Q1854567) ‎ (← links)
• Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (Q2508966) ‎ (← links)