The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January-March (1999 vol.7)
pp: 79
CITATION
Marcin Paprzycki, "Limits to Parallel Computation: P-Completeness Theory", IEEE Concurrency (out of print), vol.7, no. 1, pp. 79, January-March 1999, doi:10.1109/MCC.1999.749138
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool