New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Reduktion SAT #50

Open

vitalis- opened this issue Jun 30, 2018 · 0 comments

vitalis- commented Jun 30, 2018

Im Foliensatz zur 9. Vorlesung, Folie 18 heißt es "Durch direkte Reduktion auf das Wortproblem von polynomiell zeitbeschränkten NTMs".

Ist es nicht genau anders herum, dass wir das Wortproblem auf SAT reduzieren wollen?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment