NP is contained in DTIME(n^O(log^{gamma}))
Bruce E. Litow · arXiv (Cornell University) · 2014
We use existential Diophantine predicates carefully reinterpreted over the reals and the time complexity of Tarski algebra to show that 3-CNF SAT is in n^O(log^{gamma} n) time for an absolute positive constant gamma.