For h(n) = 3^n / (the size of the largest cap set in {0,1,2}^n)
h(n) 1
Not the answer above but log h(n)
Not the answers above but h(h(n))
Not the answer below but h(h(n)) > exp (n)
Not the answer below but h(n)>exp (n^c) for c>0
h(n) behaves like c^n for some c>1
Vote
View Results
See this poll on:
https://poll.fm/1474791/embed