P versus NP

P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? A precise statement of the P versus NP problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. Given a positive integer x and a collection S of positive integers, MAXIMUM is the problem of deciding whether x is the maximum of S. We prove this problem is complete for P. Another major complexity classes are LOGSPACE, LOGTIME and coNP. Whether LOGSPACE = P is a fundamental question that it is as important as it is unresolved. We show the problem MAXIMUM can be decided in logarithmic space. Consequently, we demonstrate the complexity class LOGSPACE is equal to P. Moreover, we define a problem called CIRCUIT-MAXIMUM. CIRCUIT-MAXIMUM are the instances of MAXIMUM represented by a positive integer x and a Boolean circuit C. We show this version of MAXIMUM is in coNP-complete under logarithmic reductions. Hence, under the assumption of P = NP, we obtain the padded version of CIRCUIT-MAXIMUM is in LOGTIME and P-hard. However, it is not possible that a P-complete problem can be decided in logarithmic time. In this way, we demonstrate the assumption of several computer scientists which is that P is not equal to NP.