NP is contained in DTIME(n^O(log^{gamma}))
Computational Complexity
2022-06-10 v7
Abstract
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.
Cite
@article{arxiv.1401.7480,
title = {NP is contained in DTIME(n^O(log^{gamma}))},
author = {Bruce Litow},
journal= {arXiv preprint arXiv:1401.7480},
year = {2022}
}
Comments
paper has a fatal error