checkout
view
Your Cart: item(s)
Computer Science, Data Structures and Algorithms
Year 1
Automata and Computability
Show the error in the following fallacious “proof” that P NP. Proof by contradiction. Assume that P = NP. Then SAT P. So, of some k, SAT TIME(nk). Because every language in NP is polynomial time reducible to SAT, NP TIME(nk). Therefore P TIME(nk). But, by the time hierarchy theorem, TIME(nk+1) contains a language which isn’t in TIME(nk), which contradicts P TIME(nk). Therefore P NP.
See attached file for full problem description.
Problem A142.doc View File
By OTA: Maddu Shankar, MSc
OTA Rating: 4.6/5
Your Price: $2.19 (original value ~$19.95)
What's included:
- Plain text response
- Attachment(s):
- Solution A142.doc
Automata and Computability - Show that the problem of testing whether two branching programs compute the same function is solvable in polynomial time if and only if P = NP
Automata and Computability (A18) - See Attached Question Sheet and Theorem Sheet
Automata and Computability (A128) - See Attached Sheet
Automata and Computability - See Attached Sheet
Automata and Computability (A136) - Show that ANFA is NL-complete.
Page generated in 0.0156 seconds