Question: Information mathematics Algorithm and complexity / Tuning machine and computational complexity / Polynomial time P / Non-deterministic polynomial time NP / NP problem Choose all
Information mathematics
Algorithm and complexity / Tuning machine and computational complexity / Polynomial time P / Non-deterministic polynomial time NP / NP problem

Choose all of the following that are correc a. Languages that belong to NP do not belong to P. b. 7 Languages that can be determined in 0 (n^7) time by a tape Turing machine belong to P c. Languages that do not belong to P are undecidable d. Languages belonging to P are Turing recognizable e. Languages that can be determined by non-deterministic Turing machines do not belong to NP f. If A is an NP-hard language, any language contained in NP can be polynomial-time reduced to A. g. If A is an NP-hard language, it is determined by a polynomial time nondeterministic Turing machine, and any language can be reduced to A by polynomial time. h. Languages that can be polynomial-time reduced to the languages contained in the NP are included in the NP. i. Polynomial time determinism If any language determined by a Turing machine can be reduced in polynomial time to language A, then A is NP-hard. j. NP-hard languages can be polynomial-time reduced to any language determined by a nondeterministic Turing machine
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
