Subject : Automata Theory & FormalLanguage
Please help me answer immediately thankyou
Answer the following questions of complexity classes: [5 marks] a) How to address the P=NP question? (2 marks) b) For each language L in P there is a polynomial-time decision algorithm A for L. If n=∣x∣, where x∈L, then how long will A runs on x ? (1 mark) c) Is P=NP ? Justify your answer. (2 marks)
Subject : Automata Theory & Formal Language Please help me answer immediately thankyou
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am