ago
0 like 0 dislike
0 like 0 dislike
Time bounded Kolmogorov complexity is known to be NP-complete. But is there a polynomial time approximation algorithm that at least approximates it to a polynomial factor?
ago

No related questions found

33.4k questions

135k answers

0 comments

33.7k users

OhhAskMe is a math solving hub where high school and university students ask and answer loads of math questions, discuss the latest in math, and share their knowledge. It’s 100% free!