wiki_research

personal research wiki
git clone https://a3nm.net/git/wiki_research/
Log | Files | Refs

boolean_clique_conjecture (196B)

      1 # Boolean clique conjecture
      2 
      3 for all ε>0, there is no [combinatorial_algorithm] that can check for a k-[clique] in an input [graph] in time O(n^{k-ε})
      4 
      5 Up: [computational_complexity_hypothesis]