Skip to main content
user834's user avatar
user834's user avatar
user834's user avatar
user834
  • Member for 13 years, 9 months
  • Last seen more than 3 years ago
19 votes

Examples of hardness phase transitions

18 votes

Problems Between P and NPC

15 votes

Which SAT problems are easy?

15 votes

Did "Where the really hard problems are" hold up? What are current ideas on the subject?

13 votes

What papers should everyone read?

11 votes
Accepted

Throwing Balls into Bins, estimate a lowerbound of its probability

9 votes

Problems that are NP-complete under randomized or P/poly reductions.

9 votes

Asymptotics for Coin changing

9 votes
Accepted

Factoring with LLL when the form of the factors is given

8 votes

What Books Should Everyone Read?

8 votes

Empirical results in CS papers

7 votes

Survey on algorithms/complexity of linear algebra

7 votes
Accepted

Algorithms with finite expected running time and infinite variance

6 votes

Complexity of Finding the Eigendecomposition of a Matrix

5 votes

What is an accessible introduction to Percolation Theory?

5 votes

Chaos and the $P{=}NP$ question

4 votes

Examples where insight from geometry was useful for solving something completely non-geometric

3 votes

Models of random graphs, for real computer networks

3 votes

Natural NP-complete problems with high density?

2 votes

Book for self study of algorithms in group theory

2 votes
Accepted

Constraint Satisfaction Problem: Choosing real numbers with certain characteristics

1 vote

Any algorithmic problem has a time complexity dominated by counting?

1 vote

Necessary condition for a graph to be Non-Hamiltonian