templatetypedef
  • Member for 9 years, 6 months
  • Last seen more than a week ago
15 answers
121 votes
15k views
56 bookmarks
How to fool the "try some test cases" heuristic: Algorithms that appear correct, but are actually incorrect
11 answers
93 votes
24k views
94 bookmarks
Solving or approximating recurrence relations for sequences of numbers
2 answers
28 votes
599 views
6 bookmarks
How to efficiently determine whether a given ladder is valid?
3 answers
23 votes
2k views
9 bookmarks
Why are NP-complete problems so different in terms of their approximation?
3 answers
22 votes
1k views
6 bookmarks
Algorithm to minimize surface area, given volume
1 answers
20 votes
527 views
6 bookmarks
Ratio of decidable problems
2 answers
18 votes
2k views
5 bookmarks
A polynomial reduction from any NP-complete problem to bounded PCP
2 answers
18 votes
3k views
4 bookmarks
What is an IELR(1)-parser?
1 answers
16 votes
357 views
6 bookmarks
Lost in a "one directional" concert
3 answers
16 votes
5k views
7 bookmarks
Why not to take the unary representation of numbers in numeric algorithms?
1 answers
16 votes
393 views
2 bookmarks
Complexity classes pertaining to listing all solutions?
1 answers
14 votes
251 views
2 bookmarks
When did $LR(k)$ acquire the meaning "left-to-right scan, rightmost derivation?"
1 answers
13 votes
1k views
3 bookmarks
Use minimum number of swaps so each bin contains balls of the same color
1 answers
12 votes
384 views
4 bookmarks
Is packing a bag of presents easier for Rupert than Santa?
1 answers
12 votes
10k views
4 bookmarks
How do I construct a doubly connected edge list given a set of line segments?
1 answers
11 votes
1k views
3 bookmarks
Tighter analysis of modified Borůvka's algorithm
1 answers
11 votes
793 views
5 bookmarks
Can top SAT-solvers factor easy numbers?
1 answers
11 votes
839 views
3 bookmarks
Bound on space for selection algorithm?
1 answers
11 votes
4k views
2 bookmarks
Graphs that cause DFS and BFS to process nodes in the exact same order
3 answers
10 votes
886 views
2 bookmarks
Sums of Landau terms revisited
3 answers
8 votes
5k views
2 bookmarks
Proving that any CF language over a 1 letter alphabet is regular
1 answers
8 votes
956 views
1 bookmarks
Prove n! is fully time constructible
1 answers
8 votes
501 views
4 bookmarks
Data Flow Analysis with exceptions
1 answers
7 votes
89 views
1 bookmarks
Is THEADS the same as FIRST?
1 answers
7 votes
1k views
2 bookmarks
How does the Galil's rule work on Boyer-Moore algorithm?
1 answers
7 votes
352 views
3 bookmarks
Travelling with the most efficient path
1 answers
6 votes
116 views
3 bookmarks
Is there a term for the general method used in XORed linked list?
1 answers
6 votes
4k views
5 bookmarks
Why is the path compression (no rank) for disjoint sets $O(\log n)$ amortized for Find-Set?
1 answers
5 votes
78 views
2 bookmarks
Is there a model of ZF¬C where some program always terminates but has no loop variant?
2 answers
3 votes
4k views
2 bookmarks
Why are palindrome and not-palindrome both context-free?