The method for analyzing algorithmic runtime complexity using decision trees is discussed using the sorting algorithm. This method is then extended to optimal algorithms which may find all cliques of size q in network N, or simply the first clique of size q in network N. Finally, the lower bound of such decision trees is demonstrated to not be in P.
@article{arxiv.1601.03619,
title = {P vs. NP},
author = {Daniel Uribe},
journal= {arXiv preprint arXiv:1601.03619},
year = {2025}
}
Comments
Work was not peer reviewed, guided by a mentor, nor associated with a research institution. Does not describe problem, explain its importance, nor independently construct critical equations, e.g. Legendre formula is an inequality but is stated as and equality (known to be false)