|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Limits to Parallel Computation: P-Completeness Theory
January-March 1999 (vol. 7 no. 1)
pp. 79
| ASCII Text | x | ||
| Marcin Paprzycki, Trobec Roman, "Limits to Parallel Computation: P-Completeness Theory," IEEE Concurrency, vol. 7, no. 1, pp. 79, January-March, 1999. | |||
| BibTex | x | ||
| @article{ 10.1109/MCC.1999.749138, author = {Marcin Paprzycki and Trobec Roman}, title = {Limits to Parallel Computation: P-Completeness Theory}, journal ={IEEE Concurrency}, volume = {7}, number = {1}, issn = {1092-3063}, year = {1999}, pages = {79}, doi = {http://doi.ieeecomputersociety.org/10.1109/MCC.1999.749138}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - MGZN JO - IEEE Concurrency TI - Limits to Parallel Computation: P-Completeness Theory IS - 1 SN - 1092-3063 SP EP EPD - 79 A1 - Marcin Paprzycki, A1 - Trobec Roman, PY - 1999 VL - 7 JA - IEEE Concurrency ER - | |||
Citation:
Marcin Paprzycki, Trobec Roman, "Limits to Parallel Computation: P-Completeness Theory," IEEE Concurrency, vol. 7, no. 1, pp. 79, Jan.-March 1999, doi:10.1109/MCC.1999.749138
Usage of this product signifies your acceptance of the Terms of Use.