Abstract:Thanks to my short studies about informatics, I present to you this mathematical proof that deals with the sets of P problems, NP-Complete problems and NP-Hard problems in order to prove new formulas about the cardinality of each group of problems and about the intersection of each one of these sets. This work ends with a theoremabout the complexity ofproblems that allows us to identify NP problems even if their algorithms have infinite time of execution. Hence, I invite all the readers to use and develop the… Show more
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.