[mjkldfyj] 3SAT and TREE(3)

Hypothetically: "Here's an algorithm to solve 3SAT in O(n^TREE(3)) time.  So P=NP."

We conjecture the existence of such an algorithm only because the name of both things contain the number 3.

Previously, on polynomial algorithms with very large exponents.

SSCG(3) is bigger.