OK
Ondřej Kašpar
info
Please Note
<p>This page displays the records of the person named above and is not linked to a unique person identifier. This record may need to be merged to a profile.</p>
1 records found
1
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
...