Pages that link to "Item:Q1115606"
From MaRDI portal
The following pages link to Meanders and their applications in lower bounds arguments (Q1115606):
Displaying 15 items.
- Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance (Q844146) (← links)
- Superconcentrators of depths 2 and 3; odd levels help (rarely) (Q1318476) (← links)
- Two tapes versus one for off-line Turing machines (Q1321033) (← links)
- Efficient oblivious branching programs for threshold and mod functions (Q1384527) (← links)
- Time-space tradeoffs for branching programs (Q1604208) (← links)
- On the complexity of planar Boolean circuits (Q1842774) (← links)
- On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs (Q1854567) (← links)
- On relations between counting communication complexity classes (Q1880784) (← links)
- On multi-partition communication complexity (Q1886038) (← links)
- On lower bounds for read-\(k\)-times branching programs (Q2366719) (← links)
- On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth (Q2408558) (← links)
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (Q2508966) (← links)
- Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication (Q2771493) (← links)
- Finding the Median (Obliviously) with Bounded Space (Q3448777) (← links)
- Separating complexity classes related to bounded alternating ?-branching programs (Q4327378) (← links)
