Reduktion SAT
Open
- Dominant language
- TeX
- Stars
- 28
- Forks
- 27
- PR merge metrics
- No merged PRs in 30d
Description
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?
Contributor guide
No contributing guide indexed for this repository
Research direction
Open the slide deck for the 9th lecture and inspect slide 18, whose wording is quoted in the issue. Check the reduction direction against the surrounding material, then correct the statement if the issue's concern is confirmed.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- tex
- Domain
- documentation
- Issue type
- Documentation
- Difficulty
- 1/5
- Estimated time
- Under an hour
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100