    Sentence, I: What. thesis specifies that a, polynomial  relationship. exists within time, complexities in, a  computational model?    Sentence 2: This forms, the basis for the complexity  class P, which is, the set of decision problems solvable  by a. deterministic Turing machine within, polynomial  time.