This paper presents a formal proof for P = NP by establishing a polynomial-time reduction from the Boolean Satisfiability Problem SAT to a newly defined class of monotonically ascending deterministic functions (Problem A). We demonstrate that Problem A is NP-complete and resolvable in O (\ N) time via binary search. By transitivity of Karp reductions, we conclude that all NP-complete problems are solvable in logarithmic time.
יהוה et al. (Mon,) studied this question.