Published in: LIPIcs, Volume 60, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)
Dhruv Medarametla and Aaron Potechin. Bounds on the Norms of Uniform Low Degree Graph Matrices. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 60, pp. 40:1-40:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{medarametla_et_al:LIPIcs.APPROX-RANDOM.2016.40, author = {Medarametla, Dhruv and Potechin, Aaron}, title = {{Bounds on the Norms of Uniform Low Degree Graph Matrices}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)}, pages = {40:1--40:26}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-018-7}, ISSN = {1868-8969}, year = {2016}, volume = {60}, editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.40}, URN = {urn:nbn:de:0030-drops-66638}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.40}, annote = {Keywords: sum of squares hierarchy, matrix norm bounds} }
Feedback for Dagstuhl Publishing