Sketching Approximability of (Weak) Monarchy Predicates - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan 0001, Santhoshini Velusamy. Sketching Approximability of (Weak) Monarchy Predicates. In Amit Chakrabarti, Chaitanya Swamy, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference). Volume 245 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

This author has not been identified. Look up 'Chi-Ning Chou' in GoogleThis author has not been identified. Look up 'Alexander Golovnev' in GoogleThis author has not been identified. Look up 'Amirbehshad Shahrasbi' in GoogleThis author has not been identified. Look up 'Madhu Sudan 0001' in GoogleThis author has not been identified. Look up 'Santhoshini Velusamy' in Google

runs on WebDSL