complexity-theory

相关标签：javascript jquery android 多少钱 iPhone

Complexity of stl deque::insert()

I learned the complexity of deque::insert() from the C++ standard 2003 (chapter 23.2.1.3) as follows:[详细]

2023-04-08 08:30 分类：问答
Efficient Algorithms for Computing a matrix times its transpose [closed]

Closed. This question needs to be more focused. It is not currently accepting answers.开发者_JS百科[详细]

2023-04-07 22:50 分类：问答
Optimal data structure for a special dictionary

Which data structure is best in terms of computational complexity to implement a dictionary of (key,val) items, which must support only following commands:[详细]

2023-04-07 15:25 分类：问答
How is it possible to build a suffix tree in linear time?

To build a suffix tree, in the worst cas开发者_开发问答e if all the letter of the string are different the complexity would be something like[详细]

2023-04-06 00:28 分类：问答
How to calculate big-theta

Can some one provide me a real time example for how to calculate big theta. Is big theta some thing like average case, (min-max)/开发者_JS百科2?[详细]

2023-04-05 18:02 分类：问答
Is it possible that time complexity of any algorithm decrease as the input size increase, any example

I just read in Cormen\'s algorithm book that big-O and big-omega do not follow the trichotomy property. That means for two functions, f(n) and g(n), it may be the case that neither f(n) = O(g(n)) nor[详细]

2023-04-05 09:36 分类：问答
complexity analysis of algorithm

here is code, which fillstwo dimensional array with random genarated numbers in range [1 19] without duplication, my question is: how to determine it\'s complexity?[详细]

2023-04-04 21:10 分类：问答
Is a reduction enough for proving NP-complete or do I need a transformation?

If I have a decision problem开发者_开发技巧 A, and wish to show that it is NP-complete.Is it enough to prove that another NP-complete problem polynomially reduces to A, or must I show that another NP-[详细]

2023-04-04 10:37 分类：问答
Trouble with nested for-loop running time

I have been thinking over this problem for a few days now and am hung up on calculating the number of times the second nested for-loop will run. I believe that I have the correct formula for determini[详细]

2023-04-03 20:17 分类：问答
Are all NP problems also NP-complete?

The definition of NP-complete is A problem开发者_高级运维 is NP-complete if it belongs to class NP[详细]

2023-04-03 17:15 分类：问答