Lower Bounds for Recognizing Small Cliques on CRCW PRAM's

Similar Items

• A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem
  by: Barak, Boaz, et al.
  Published: (2022)
• A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem
  by: Barak, Boaz, et al.
  Published: (2018)
• Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
  by: Dalirrooyfard, Mina, et al.
  Published: (2024)
• Clique percolation
  by: Bollobas, B, et al.
  Published: (2008)
• Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
  by: Belyi, Alexander, et al.
  Published: (2023)