Go to the corresponding LIPIcs Volume Portal 
Hirahara, Shuichi ; Ilango, Rahul ; Loff, Bruno
pdfformat: 

@InProceedings{hirahara_et_al:LIPIcs.CCC.2021.31, author = {Hirahara, Shuichi and Ilango, Rahul and Loff, Bruno}, title = {{Hardness of ConstantRound Communication Complexity}}, booktitle = {36th Computational Complexity Conference (CCC 2021)}, pages = {31:131:30}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771931}, ISSN = {18688969}, year = {2021}, volume = {200}, editor = {Kabanets, Valentine}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14305}, URN = {urn:nbn:de:0030drops143055}, doi = {10.4230/LIPIcs.CCC.2021.31}, annote = {Keywords: NPcompleteness, Communication Complexity, Round Elimination Lemma, MetaComplexity} }
Keywords:  NPcompleteness, Communication Complexity, Round Elimination Lemma, MetaComplexity  
Collection:  36th Computational Complexity Conference (CCC 2021)  
Issue Date:  2021  
Date of publication:  08.07.2021 