Hi,

My question as follows:

In theoretical computer science, there is a concept of complexity classes for example NP-Completeness. I want to know the research or any views to relate NP-completeness with the UML 2.0?

regards,

Pin It on Pinterest

Share This