Pr ¿ NCr
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 a polynomial number of processors.
| Autor: | |
|---|---|
| Tipo de documento: | Relatório |
| Data de publicação: | 1991 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositório: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | Inglês |
| OAI Identifier: | oai:upcommons.upc.edu:2117/330403 |
| Acesso em linha: | https://hdl.handle.net/2117/330403 |
| Nível de acesso: | Acesso aberto |
| Palavra-chave: | Polynomials Polinomis Àrees temàtiques de la UPC::Informàtica |
| Resumo: | 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 a polynomial number of processors. |
|---|