2023
DOI: 10.21203/rs.3.rs-2551316/v2
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

New mathematical statements about the cardinality and the intersection of P problems, NP problems and NP-Hard problems

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

Help me understand this report

This publication either has no citations yet, or we are still processing them

Set email alert for when this publication receives citations?

See others like this or search for similar articles