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?
I’m a Postdoctoral Researcher at SOM Research Team, in Barcelona. Currently, I’m involved in the development of scalable tools for MDE, especially in the persistence of Very Large Models.