Discussion
What is the time complexity class P ?
Answer: A
The class P is problems solvable in polynomial time.
P is the set of decision problems that a deterministic Turing machine can solve in O(nk) time for some constant k. Examples include sorting, shortest paths and primality testing. These are generally treated as efficiently solvable.
Problems whose solutions can be verified in polynomial time form NP, the trap here. Problems solvable in exponential time form EXPTIME. Undecidable problems, such as the halting problem, cannot be solved by any algorithm at all.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development