Skip to main content
deleted 48 characters in body
Source Link
maxdan94
  • 563
  • 2
  • 11

Thanks a lot for your comment, I think it can be an answer. Sorry if this is not a research-level question.

I have this practical algorithm and I'm trying to express its running time as a function of some parameters and not only the size of the input. If parametrized-complexity is not the right keyword, could you help me to understand what is parametrized-complexity and to find the right keyword?

Following what you said, I have: O(ppp!(np)k)=O(epppknk)=O(1k(enk)k). If now I replace p by k in the original formula, I have O(nkk!).

So I can claim (i) the complexity of the algorithm is in O((n4)k), (ii) the complexity of the algorithm is in O(1k(enk)k) and (iii) the complexity of the algorithm is in O(nkk!). Is that correct?

Thanks a lot for your comment, I think it can be an answer. Sorry if this is not a research-level question.

I have this practical algorithm and I'm trying to express its running time as a function of some parameters and not only the size of the input. If parametrized-complexity is not the right keyword, could you help me to understand what is parametrized-complexity and to find the right keyword?

Following what you said, I have: O(ppp!(np)k)=O(epppknk)=O(1k(enk)k). If now I replace p by k in the original formula, I have O(nkk!).

So I can claim (i) the complexity of the algorithm is in O((n4)k), (ii) the complexity of the algorithm is in O(1k(enk)k) and (iii) the complexity of the algorithm is in O(nkk!). Is that correct?

Thanks a lot for your comment, I think it can be an answer.

I have this practical algorithm and I'm trying to express its running time as a function of some parameters and not only the size of the input. If parametrized-complexity is not the right keyword, could you help me to understand what is parametrized-complexity and to find the right keyword?

Following what you said, I have: O(ppp!(np)k)=O(epppknk)=O(1k(enk)k). If now I replace p by k in the original formula, I have O(nkk!).

So I can claim (i) the complexity of the algorithm is in O((n4)k), (ii) the complexity of the algorithm is in O(1k(enk)k) and (iii) the complexity of the algorithm is in O(nkk!). Is that correct?

deleted 21 characters in body
Source Link
maxdan94
  • 563
  • 2
  • 11

Thanks a lot for your comment, I think it can be an answer. Sorry if this is not a research-level question. I am doing research.

I have this practical algorithm and I'm trying to express its running time as a function of some parameters and not only the size of the input. If parametrized-complexity is not the right keyword, could you help me to understand what is parametrized-complexity and to find the right keyword?

Following what you said, I have: O(ppp!(np)k)=O(epppknk)=O(1k(enk)k). If now I replace p by k in the original formula, I have O(nkk!).

So I can claim (i) the complexity of the algorithm is in O((n4)k), (ii) the complexity of the algorithm is in O(1k(enk)k) and (iii) the complexity of the algorithm is in O(nkk!). Is that correct?

Thanks a lot for your comment, I think it can be an answer. Sorry if this is not a research-level question. I am doing research.

I have this practical algorithm and I'm trying to express its running time as a function of some parameters and not only the size of the input. If parametrized-complexity is not the right keyword, could you help me to understand what is parametrized-complexity and to find the right keyword?

Following what you said, I have: O(ppp!(np)k)=O(epppknk)=O(1k(enk)k). If now I replace p by k in the original formula, I have O(nkk!).

So I can claim (i) the complexity of the algorithm is in O((n4)k), (ii) the complexity of the algorithm is in O(1k(enk)k) and (iii) the complexity of the algorithm is in O(nkk!). Is that correct?

Thanks a lot for your comment, I think it can be an answer. Sorry if this is not a research-level question.

I have this practical algorithm and I'm trying to express its running time as a function of some parameters and not only the size of the input. If parametrized-complexity is not the right keyword, could you help me to understand what is parametrized-complexity and to find the right keyword?

Following what you said, I have: O(ppp!(np)k)=O(epppknk)=O(1k(enk)k). If now I replace p by k in the original formula, I have O(nkk!).

So I can claim (i) the complexity of the algorithm is in O((n4)k), (ii) the complexity of the algorithm is in O(1k(enk)k) and (iii) the complexity of the algorithm is in O(nkk!). Is that correct?

edited body
Source Link
maxdan94
  • 563
  • 2
  • 11

Thanks a lot for your comment, I think it can be an answer. Sorry if this is not a research-level question.

  I am doing research. 

I have this practical algorithm and I'm trying to express its running time as a function of some parameters and not only the size of the input. If parametrized-complexity is not the right keyword, could you help me to understand what is parametrized-complexity and to find the right keyword?

Following what you said, I have: O(ppp!(np)k)=O(epppknk)=O(1k(enk)k). If now I replace p by k in the original formula, I have O(nkk!).

So I can claim (i) the complexity of the algorithm is in O((n4)k), (ii) the complexity of the algorithm is in O(1k(enk)k) and (iii) the complexity of the algorithm is in O(nkk!). Is that correct?

Thanks a lot for your comment, I think it can be an answer. Sorry if this is not a research-level question.

  I am doing research. I have this practical algorithm and I'm trying to express its running time as a function of some parameters and not only the size of the input. If parametrized-complexity is not the right keyword, could you help me to understand what is parametrized-complexity and to find the right keyword?

Following what you said, I have: O(ppp!(np)k)=O(epppknk)=O(1k(enk)k). If now I replace p by k in the original formula, I have O(nkk!).

So I can claim (i) the complexity of the algorithm is in O((n4)k), (ii) the complexity of the algorithm is in O(1k(enk)k) and (iii) the complexity of the algorithm is in O(nkk!). Is that correct?

Thanks a lot for your comment, I think it can be an answer. Sorry if this is not a research-level question. I am doing research. 

I have this practical algorithm and I'm trying to express its running time as a function of some parameters and not only the size of the input. If parametrized-complexity is not the right keyword, could you help me to understand what is parametrized-complexity and to find the right keyword?

Following what you said, I have: O(ppp!(np)k)=O(epppknk)=O(1k(enk)k). If now I replace p by k in the original formula, I have O(nkk!).

So I can claim (i) the complexity of the algorithm is in O((n4)k), (ii) the complexity of the algorithm is in O(1k(enk)k) and (iii) the complexity of the algorithm is in O(nkk!). Is that correct?

added 144 characters in body
Source Link
maxdan94
  • 563
  • 2
  • 11
Loading
Source Link
maxdan94
  • 563
  • 2
  • 11
Loading