Substitution for Landau's O notation formula
-
05-11-2019 - |
Pergunta
I found the following description when I was reading a paper on computational complexity theory.
This can be done ... in time 2n・poly(logs,n)+2O(logs)c. For s≤2no(1), the runtime is 2n・poly(n).
I know this means substituting s≤2no(1) for 2n・poly(logs,n)+2O(logs)c results in 2n・poly(n), but I don't know how this is done. So please tell me the calculation process.
Nenhuma solução correta
Licenciado em: CC-BY-SA com atribuição
Não afiliado a cs.stackexchange