OhhAskMe
Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
All Activity
Q&A
Questions
Hot!
Unanswered
Users
Ask a Question
Dark Mode
Is there a polynomial time approximation algorithm for time bounded kolmogorov complexity?
Puressentiel_IT
asked
4 days
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?
algorithms
Puressentiel_IT
asked
4 days
ago
by
Puressentiel_IT
answer
comment
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
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!
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy