Go to the corresponding LIPIcs Volume Portal 
Guruswami, Venkatesan ; Kothari, Pravesh K. ; Manohar, Peter
pdfformat: 

@InProceedings{guruswami_et_al:LIPIcs.APPROX/RANDOM.2022.42, author = {Guruswami, Venkatesan and Kothari, Pravesh K. and Manohar, Peter}, title = {{Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)}, pages = {42:142:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772495}, ISSN = {18688969}, year = {2022}, volume = {245}, editor = {Chakrabarti, Amit and Swamy, Chaitanya}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/17164}, URN = {urn:nbn:de:0030drops171642}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.42}, annote = {Keywords: Planted clique, Averagecase complexity, Spectral refutation, Random matrix theory} }
Keywords:  Planted clique, Averagecase complexity, Spectral refutation, Random matrix theory  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)  
Issue Date:  2022  
Date of publication:  15.09.2022 