91影视

a)

P is class of languages that are decidable in polynomial time on a deterministic single $-$ tape Turing machine. We have to construct an deterministic Turing machine $(D T M)$ to decide SPATH in polynomial time.

Let M be the DTM to decide SPATH in polynomial time.

The algorithm of M is as follows:

$M=\text{'}\text{'}on鈥�input鈥�\$鉄�G,a,b,k鉄�\$where鈥�m-node鈥�graph鈥�G鈥�has鈥�nodes鈥�a鈥�and鈥�b:$

Place a mark "o" on node a.

for each$ifrom0tom:$

If an $edge\left(s,t\right)$is found connecting s marked as "$i$" to an unmarked node$t$ , mark node$t$ with "$i+1^{\text{'}\text{'}}\$.$

If$b$ is marked with a value at most$k$ , accept. Otherwise reject.

This algorithm is similar to PATH algorithm. Here we additionally need to keep the track of length of the shortest paths discovered. That will be done in polynomial time

$\$O\left(\left|V\right|+\left|E\right|\right)\$.$

Hence, we constructed a DTM M to decide SPATH in polynomial time.

Therefore,$SPATH+1鈭�P\$.$

(b)

NP - complete: A language B is NP-complete if it satisfies two conditions.

$\$B\$isinNP$and

Every A in NP is polynomial time reducible to B.

To show$LPATH鈥�is鈥�NP-complete,鈥�we鈥�need鈥�show鈥�\$LPATH鈭�NP\$鈥�and鈥�\$鈥�鈥�UHAMPATH{猢�}_{P}LPATH$

$LPATH鈭�NP:$We know that "NP is the class of languages that have polynomial time verifies.

We construct a verifies$鈭�\$for\$LPATH$as follows:

:$V=\$\text{'}\text{'}on鈥�input\$鉄�G,a,b,k,c鉄�\$,where鈥�c鈥�is鈥�a鈥�path$

Check is a non - repeated sequence of nodes in G

Check the first term of c is a and last is b.

Check the length of c is larger than or equal to k.

If c satisfies the conditions, accept.

Otherwise, reject

This verifier v can finish in $O\left(ICI\right)$where $\left|c\right|$is the length of $c$.

So,$LPATH鈭�NP.$

Therefore, the LPATH is NP-complete.