1 Hit in 5.8 sec

On Sketching the q to p Norms

Aditya Krishnan, Sidhanth Mohanty, David P. Woodruff, Michael Wagner
2018 International Workshop on Approximation Algorithms for Combinatorial Optimization  
of approximation, and oblivious routing.  ...  We provide upper and lower bounds on the sketching dimension k for every p, q ∈ [1, ∞], and in a number of cases our bounds are tight.  ...  In Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceed- ings, Part I, pages 31-42, 2010. 17 Jop Briët, Oded Regev, and Rishi Saket  ... 
doi:10.4230/lipics.approx-random.2018.15 dblp:conf/approx/KrishnanMW18 fatcat:bo4s42dlijeldba46dmwrlqq7q