User john_leo

14 votes

The number of different regular languages

answered Jul 17, 2014 at 8:53

12 votes

What is the definition of Computer Science, and what is the Science within Computer Science?

answered Oct 15, 2013 at 8:55

11 votes

Accepted

Compression functions are only practical because "The bit strings which occur in practice are far from random"?

answered Mar 24, 2015 at 8:34

8 votes

Why do we say that polynomial time is easy?

answered Aug 15, 2015 at 12:41

6 votes

complexity of determining whether a language given by context free grammar is empty

answered Oct 22, 2014 at 12:56

5 votes

Accepted

Balancing a Binary Search Tree

answered Nov 10, 2014 at 16:45

5 votes

Accepted

Subset sum algorithm in O(n³ log n)?

answered Nov 25, 2014 at 19:52

4 votes

Accepted

What is the complexity of finding the two prime numbers a composite number (used in RSA Protocol) is made of?

answered Nov 3, 2014 at 10:23

4 votes

Accepted

Reduction to Maximum Independent Set

answered Aug 6, 2014 at 17:27

3 votes

Does $DTIME(2^n)$ contain $NSPACE(n)$ ?

answered Jan 21, 2014 at 11:10

2 votes

Efficiently representing a set of sets

answered Mar 19, 2014 at 17:30

2 votes

Calculating time complexity of two interdependent nested for loops

answered Mar 19, 2014 at 20:22

2 votes

Compression technique exploiting common similarities

answered Apr 8, 2014 at 10:06

2 votes

Why is the O(nW) algorithm for the Knapsack problem not a polynomial one?

answered Oct 28, 2014 at 17:33

1 vote

Bubblesort generalization

answered Nov 8, 2014 at 18:42

1 vote

Introduction to number theory

answered Feb 9, 2015 at 16:14

0 votes

Compression of non-adjacent structure using grammar

answered Apr 8, 2014 at 10:18

0 votes

Do all decidable problems lie in the class NP?

answered May 24, 2014 at 9:24

Stack Exchange Network

18 Answers

The number of different regular languages

What is the definition of Computer Science, and what is the Science within Computer Science?

Compression functions are only practical because "The bit strings which occur in practice are far from random"?

Why do we say that polynomial time is easy?

complexity of determining whether a language given by context free grammar is empty

Balancing a Binary Search Tree

Subset sum algorithm in O(n³ log n)?

What is the complexity of finding the two prime numbers a composite number (used in RSA Protocol) is made of?

Reduction to Maximum Independent Set

Does $DTIME(2^n)$ contain $NSPACE(n)$ ?

Efficiently representing a set of sets

Calculating time complexity of two interdependent nested for loops

Compression technique exploiting common similarities

Why is the O(nW) algorithm for the Knapsack problem not a polynomial one?

Bubblesort generalization

Introduction to number theory

Compression of non-adjacent structure using grammar

Do all decidable problems lie in the class NP?