User user340082710

12 votes

Accepted

Big-O proof for a recurrence relation?

answered Dec 10, 2015 at 3:17

8 votes

Language for teaching basic programming

answered Jun 9, 2014 at 3:32

7 votes

Accepted

Master Method to solve recurrences is 'a' related to 'b'?

answered Jun 27, 2014 at 3:01

5 votes

Accepted

Contradiction between best-case running time of insertion sort and $n\log n$ lower bound?

answered Jan 25, 2015 at 2:05

5 votes

Accepted

Prove transitivity of big-O notation

answered Jan 29, 2015 at 0:55

5 votes

Accepted

Decomposing the n-cube into vertex-disjoint paths

answered Apr 1, 2016 at 16:54

5 votes

An FPT algorithm for Hamiltonian cycle running parameterized by treewidth

answered Jun 6, 2016 at 19:10

4 votes

Accepted

A Graph's Density and Sparsity

answered Mar 17, 2016 at 5:32

3 votes

TSP polynomial Time

answered Apr 17, 2015 at 19:53

3 votes

Can one increment an $n$ bit integer using fewer than $2 - 2^{1-n}$ bit inspections on average?

answered Dec 10, 2015 at 2:33

3 votes

Accepted

Why is the complexity of this nested for loop not $O(n^2)$?

answered Jan 25, 2015 at 23:21

2 votes

Accepted

Explanation of the complexity of a loop

answered Jun 13, 2014 at 22:50

1 vote

Accepted

Approximating all independent sets of size k in a graph

answered Mar 12, 2016 at 1:12

Stack Exchange Network

13 Answers

Big-O proof for a recurrence relation?

Language for teaching basic programming

Master Method to solve recurrences is 'a' related to 'b'?

Contradiction between best-case running time of insertion sort and $n\log n$ lower bound?

Prove transitivity of big-O notation

Decomposing the n-cube into vertex-disjoint paths

An FPT algorithm for Hamiltonian cycle running parameterized by treewidth

A Graph's Density and Sparsity

TSP polynomial Time

Can one increment an $n$ bit integer using fewer than $2 - 2^{1-n}$ bit inspections on average?

Why is the complexity of this nested for loop not $O(n^2)$?

Explanation of the complexity of a loop

Approximating all independent sets of size k in a graph