Top network posts
- 21 Can one show NP-hardness by Turing reductions?
- 14 How to practically construct regular expander graphs?
- 12 Does the complexity of strongly NP-hard or -complete problems change when their input is unary encoded?
- 9 Hermite Polynomials Triple Product
- 7 NP complete problems that are solvable in polynomial time if the input (e.g. number of variables) is fixed?
- View more network posts →
Keeping a low profile.
This user hasn't posted yet.
Nov 14 '19