Recent questions tagged complexity

0 votes

279 views

1 answer

complexity theory - Algorithm to find maximum coverage of non-overlapping sequences. (I.e., the Weighted Interval Scheduling Prob.)

I have a question that is very similar to algorithm to find longest non-overlapping sequences. The only difference to the ... of O(N log(N)). See Question&Answers more detail:os...

asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)

0 votes

188 views

1 answer

complexity of parsing C++

Out of curiosity, I was wondering what were some "theoretical" results about parsing C++. Let n be ... References would be greatly appreciated! See Question&Answers more detail:os...

asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)

0 votes

177 views

1 answer

complexity of parsing C++

Out of curiosity, I was wondering what were some "theoretical" results about parsing C++. Let n be ... References would be greatly appreciated! See Question&Answers more detail:os...

asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)

0 votes

186 views

1 answer

complexity of parsing C++

Out of curiosity, I was wondering what were some "theoretical" results about parsing C++. Let n be ... References would be greatly appreciated! See Question&Answers more detail:os...

asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)

0 votes

256 views

1 answer

complexity theory - algorithm to find longest non-overlapping sequences

I am trying to find the best way to solve the following problem. By best way I mean less complex. As an input a ... is shorter than [(3,20)]. See Question&Answers more detail:os...

asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)

0 votes

287 views

1 answer

complexity theory - Upper bound vs lower bound for worst case running time of an algorithm

I am learning about analysis of algorithms. I understand the concept of the worst case running time of an ... time of the same algorithm? See Question&Answers more detail:os...

asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)

0 votes

327 views

1 answer

complexity theory - Example of a factorial time algorithm O( n! )

I'm studying time complexity in school and our main focus seems to be on polynomial time O(n^c) algorithms ... algorithm to solve the problem. See Question&Answers more detail:os...

asked Oct 24, 2021 in Technique[技术] by 深蓝 (71.8m points)

0 votes

254 views

1 answer

complexity theory - Databases versus plain text

When dealing with small projects, what do you feel is the break even point for storing data in simple text ... -hoc techniques I typically use. See Question&Answers more detail:os...

asked Oct 17, 2021 in Technique[技术] by 深蓝 (71.8m points)

Categories

Just Browsing Browsing

Most popular tags