user avatar
user avatar
user avatar
FrankW
  • Member for 8 years, 7 months
  • Last seen more than 5 years ago
30 votes
Accepted

Using base 80 for compressing files

29 votes

How to simulate a die given a fair coin

15 votes
Accepted

Is regex golf NP-Complete?

13 votes

Word Frequency with Ordering in O(n) Complexity

12 votes
Accepted

QuickSort Dijkstra 3-Way Partitioning: why the extra swapping?

11 votes
Accepted

Are regex crosswords NP-hard?

9 votes
Accepted

Bin packing problem or not?

9 votes
Accepted

Optimal Algorithm for checking if a number is a multiple of three

8 votes
Accepted

Why addition algorithm is not pseudo- polynomial?

8 votes
Accepted

Origins of misconception about using equality signs with Landau notation

8 votes
Accepted

Convert DFA to Regular Expression

7 votes
Accepted

Number of Different AVL Tree

7 votes
Accepted

Solving the recurrence T(n) = 3T(n-2) with iterative method

7 votes
Accepted

Data Structure For Closest Pair Problem

6 votes
Accepted

$L \in RE/R$ such that $L^R \cup L \in R$

6 votes
Accepted

Why can't we solve the dinner party problem by finding a maximum matching?

6 votes
Accepted

Check whether it is possible to turn one BST into another using only right-rotations

6 votes

What is the notation for bounding running time in worst case with concrete example resulting in that worst case running time

6 votes

Remove minimum number of vertices to disconnect the graph

6 votes
Accepted

What is my error in reasoning about the complexity class $n^{o(1)}$

5 votes
Accepted

Kleene closure of the empty set

5 votes

minimum vertex set removal for edge-free graph

5 votes
Accepted

Small-step semantics: for-loops

5 votes
Accepted

Complexity of keeping track of $K$ smallest integers in a stream

5 votes
Accepted

Defining a context-free grammar for $\{w \in \{0, 1\}^* : \#_0(w) = \#_1(w)\}$

5 votes
Accepted

P, NP and polynomial time reduction?

4 votes
Accepted

Prove that context free languages aren't closed under DropMiddle

4 votes

Kleene Star Property : L*L* = L*

4 votes
Accepted

Given $k$ sorted lists, $O(n \log k)$ complexity, Mergesort rather than Heapsort

4 votes

Satisfiabilty 2-sat

1
2 3 4 5