User SamM

15 votes

Generalised 3SUM (k-SUM) problem?

answered Aug 1, 2012 at 0:20

14 votes

Accepted

How can it be detected that a number generator is not really random?

answered Jan 3, 2013 at 23:22

14 votes

Is O(mn) considered "linear" or "quadratic" growth?

answered Feb 7, 2013 at 20:34

12 votes

Accepted

Why is $3^n = 2^{O(n)}$ true?

answered Dec 1, 2012 at 21:01

12 votes

Accepted

Two functions $g(n)$, $G(n)$ such that $g(n) = o(G(n))$ but $g(n+1) \neq o(G(n))$

answered Nov 26, 2012 at 21:38

12 votes

Accepted

Is it decidable whether a TM reaches some position on the tape?

answered Aug 11, 2012 at 20:48

9 votes

Relation between interactive proof systems (IP), NP, coNP, PSPACE

answered Nov 15, 2012 at 15:15

8 votes

Accepted

Base of logarithm in runtime of Prim's and Kruskal's algorithms

answered Nov 1, 2012 at 20:53

5 votes

Accepted

A hash function with predicted collisions

answered Aug 7, 2012 at 3:38

5 votes

What is the relationship between NP/NP-Complete/NP-Hard to time complexity?

answered Oct 11, 2012 at 16:13

5 votes

Is it intuitive to see that finding a Hamiltonian path is not in P while finding Euler path is?

answered Jul 21, 2012 at 7:00

4 votes

Difference between "information" and "useful information" in algorithmic information theory

answered Jul 28, 2012 at 4:33

4 votes

Why can't we use a hash tables for collision resolving in hash tables?

answered Oct 28, 2012 at 6:18

4 votes

Matching two people. One has 7% in common with the other. The other has 70% in common. What's a fair match score?

answered Apr 13, 2017 at 12:11

3 votes

Looking for books on creating and understanding theorems targeted at Computer Science

answered Aug 1, 2012 at 0:29

3 votes

What is an instance of NP complete problem?

answered Nov 29, 2012 at 2:24

2 votes

Good explanatory resource for algorithm techniques such as greedy, backtracking and recursive functions

answered Jan 6, 2013 at 18:27

2 votes

How does this recurrence relation fit the algorithm?

answered Oct 28, 2012 at 6:24

2 votes

Accepted

Approximate Subset Sum with negative numbers

answered Nov 18, 2015 at 9:41

2 votes

3-SUM hardness vs lower bounds on the complexity

answered Apr 22, 2016 at 8:48

2 votes

Puzzle/game of NP class for a high school student

answered Mar 3, 2017 at 11:59

1 vote

Sorting an already k-sorted array

answered Aug 24, 2015 at 2:37

1 vote

Modeling tiling problems as SAT problems

answered Apr 26, 2017 at 14:29

1 vote

If I have a large random array of 0s and 1s that I want to sort what kind of an algorithm and data structures should I consider?

answered Dec 9, 2012 at 3:52

Stack Exchange Network

24 Answers

Generalised 3SUM (k-SUM) problem?

How can it be detected that a number generator is not really random?

Is O(mn) considered "linear" or "quadratic" growth?

Why is $3^n = 2^{O(n)}$ true?

Two functions $g(n)$, $G(n)$ such that $g(n) = o(G(n))$ but $g(n+1) \neq o(G(n))$

Is it decidable whether a TM reaches some position on the tape?

Relation between interactive proof systems (IP), NP, coNP, PSPACE

Base of logarithm in runtime of Prim's and Kruskal's algorithms

A hash function with predicted collisions

What is the relationship between NP/NP-Complete/NP-Hard to time complexity?

Is it intuitive to see that finding a Hamiltonian path is not in P while finding Euler path is?

Difference between "information" and "useful information" in algorithmic information theory

Why can't we use a hash tables for collision resolving in hash tables?

Matching two people. One has 7% in common with the other. The other has 70% in common. What's a fair match score?

Looking for books on creating and understanding theorems targeted at Computer Science

What is an instance of NP complete problem?

Good explanatory resource for algorithm techniques such as greedy, backtracking and recursive functions

How does this recurrence relation fit the algorithm?

Approximate Subset Sum with negative numbers

3-SUM hardness vs lower bounds on the complexity

Puzzle/game of NP class for a high school student

Sorting an already k-sorted array

Modeling tiling problems as SAT problems

If I have a large random array of 0s and 1s that I want to sort what kind of an algorithm and data structures should I consider?