Brakensiek, Joshua; Guruswami, Venkatesan The quest for strong inapproximability results with perfect completeness. (English) Zbl 07475107 ACM Trans. Algorithms 17, No. 3, Article No. 27, 35 p. (2021). Cited in 2 Documents MSC: 68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) 05C15 Coloring of graphs and hypergraphs 05C65 Hypergraphs 68R07 Computational aspects of satisfiability 68W25 Approximation algorithms Keywords:inapproximability; constraint satisfaction; dictatorship testing; hardness of approximation; hypergraph coloring PDFBibTeX XMLCite \textit{J. Brakensiek} and \textit{V. Guruswami}, ACM Trans. Algorithms 17, No. 3, Article No. 27, 35 p. (2021; Zbl 07475107) Full Text: DOI Link