Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Question: Show that if P=NP, then P=PH

Short Answer

Expert verified

Reduce IIi+1Pmachine toP=CoNP machine, hence, putting it in P as well, and completing collapse of hierarchy.

Step by step solution

01

Step 1:  Assuming ∑i+1 machine M

  • Firstly, if P=NP, then because P is closed under complement, thus P=CONP. Written as, P=iP=IIiP.
  • Now using induction that if P=iP=IIiPthen P=i+1P=IIi+1P
  • Assumei+1p machine M, that consists of a run of the existential branching, then existential branching etc.
  • Assume the computation sub-tree path whose root are first universal step along path. For each such type of sub-tree, M is performing a computation. By hypothesis, IIiP=P.
  • Thus, for the forming of new machineS each of computation sub-trees can be replaced by deterministic (non- branching) polynomial time of computation.
02

Step 2: Assuming  a(n) be the number of maximum steps which are taken by other machine before the start of universal machine

  • If assume a(n) be the number of maximum steps which are taken by other machine before the start of universal machine, P(n) be the maximum steps which are taken by any deterministic which were substituted for computations in P machines, therefore S is covered by a(n)+p(a(n)).
  • Remember that the p(a(n)) term is composition of the functions, because P sub procedures with inputs are computing which may be a longer than (but it must be equal or smaller than a(n), since only a(n) steps are executed on the time the sub procedures are used).
  • Since aand pboth are polynomials, therefore S, is in NP. By hypothesis, P=NPso S is in P as well.

A similar type of argument may be used to reduce aIIi+1P machine toP=CoNP machine, hence, putting it in P as well, and completing collapse of hierarchy.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Study anywhere. Anytime. Across all devices.

Sign-up for free