EntityQ906584· pop 9· linked from 83 articlesUPSign in to savecomplexity class of decision problems solvable in polynomial time on an unambiguous Turing machine with at most one accepting path for each inputConnectionsdigital object identifierEntityInternational Standard Serial NumberEntityQ118398Entitycomputational complexity theoryEntityinteger factorizationEntityNP-completeEntityNPEntitydecision problemEntitytime complexityEntityPEntityLeslie ValiantEntityNP-hardEntitycomplexity classEntitynon-deterministic Turing machineEntityPSPACEEntityNLEntityco-NPEntityEXPTIMEEntityLEntityBPPEntityCategoriesComplexity classes