Browsing Artículos (Ciencias de la Computación e Inteligencia Artificial) by Subject "NP-complete problems"
Now showing items 1-1 of 1
Design Patterns for Efficient Solutions to NP-Complete Problems in Membrane Computing [Chapter of Book](Springer, 2018)
Many variants of P systems have the ability to generate an exponential number of membranes in linear time. This feature has been exploited to elaborate (theoretical) efficient solutions to NP-complete, or even harder, ...