The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 30 January 2020Accepted: 07 June 2021Published online: 14 September 2021Keywordsaverage-case complexity, fine-grained complexity, worst-case-to-average-case reductions, graph algorithms, random graphsAMS Subject Headings68Q17, 68Q87, 60C05Publication DataISSN (print): 0097-5397ISSN (online): 1095-7111Publisher: Society for Industrial and Applied …