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 correct a. If A is an NP-hard language, any language contained in NP can be polynomial-time reduced to A. b. 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. c. Languages that can be polynomial-time reduced to the languages contained in the NP are included in the NP. d. 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. NP-hard languages can be polynomial-time reduced to any language determined by a nondeterministic Turing machine. e