TY - JOUR
T1 - PR ≠ NCR
AU - Cucker, Felipe
PY - 1992/9
Y1 - 1992/9
N2 - In this note, we show the existence of sets of real numbers that can be decided in polynomial time for the Blum, Shub and Smale model of computation but cannot be decided in polylogarithmic parallel time using an arbitrary number of processors. © 1992.
AB - In this note, we show the existence of sets of real numbers that can be decided in polynomial time for the Blum, Shub and Smale model of computation but cannot be decided in polylogarithmic parallel time using an arbitrary number of processors. © 1992.
UR - http://www.scopus.com/inward/record.url?scp=0001242490&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0001242490&origin=recordpage
U2 - 10.1016/0885-064X(92)90024-6
DO - 10.1016/0885-064X(92)90024-6
M3 - RGC 21 - Publication in refereed journal
SN - 0885-064X
VL - 8
SP - 230
EP - 238
JO - Journal of Complexity
JF - Journal of Complexity
IS - 3
ER -