(by definition of NP). So there is some constant c such that the length of every branch is

at most n^c, and the number of choices along each branch can thus not exceed n^c.

Note that c does not have to equal b (maybe this is the source of your confusion).

]]>lecture #11, page 54.

This is the proof of the claim //"if a laguage is decided by a polynomial-time NTM N, running in time n^k, then A has a poly-time verifier".

When we saw this proof in class,we were told that:

1. each node has bounded fanout b.

2. we can think of every choice in the tree as a letter over {1…b}, meaning if we choose the first chilld of the root (from the right), the letter will be 1, etc,

that way, we can think of each 'computing track' as a string over {1…b}.

3. we said that every string like that is no longer than n^b (while the inpout length is n).

I don't understand that 3rd statement..

Thank you.

]]>if you want to get a serious answer you must write coherently. It's really hard to understand your question when the notation is unexplained and in hebrew and no reference to where is exactly your problem. ]]>

NP

וצריך לבנות מוודא.

הנחנו כי דרגת הפיצול בעץ הינה 'בי'. כמו כן אמרנו שכל מסלול הוא פולינומיאלי באורכו, כתבנו רצפי אותיות מעל 1-בי כדי לחקות מסלול חישוב - ואז אמרנו שבנינו מחרוזת שהיא מאורך לכל היותר 'אן בחזקת בי'. למה זה האורך? ]]>