AS

Ayyappasamy Sudalaiyadum Perumal

Authored

1 records found

Non-deterministic polynomial (NP-) complete problems, whose number of possible solutions grows exponentially with the number of variables, require by necessity massively parallel computation. Because sequential computers, such as solid state-based ones, can solve only small insta ...