The following pages link to Are bitvectors optimal? (Q3192013):
Displayed 7 items.
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\) (Q609740) (← links)
- Storing information with extractors. (Q1853081) (← links)
- On the bitprobe complexity of two probe adaptive schemes (Q2161242) (← links)
- The cell probe complexity of succinct data structures (Q2373728) (← links)
- Flavors of Compressive Sensing (Q4609797) (← links)
- Exponential lower bound for 2-query locally decodable codes via a quantum argument (Q5917576) (← links)
- Improved bounds for two query adaptive bitprobe schemes storing five elements (Q5918817) (← links)