The set or property of problems for which it can be proven that no polynomIAL-time algorithm exists, only exponentIAL-time algorithms.

In addition suitable contents:
[ = ] [ al ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ at ] [ b ] [ be ] [ ca ] [ ch ] [ du ] [ er ] [ et ] [ exponent ] [ exponentIAL ] [ exponentIAL-time ] [ fi ] [ file ] [ fo ] [ for ] [ h ] [ hat ] [ hm ] [ hr ] [ id ] [ il ] [ is ] [ it ] [ Lex ] [ ly ] [ mo ] [ mod ] [ module ] [ ms ] [ na ] [ ne ] [ nl ] [ no ] [ om ] [ op ] [ pe ] [ ph ] [ polynomIAL ] [ polynomIAL-time ] [ pr ] [ query ] [ rc ] [ re ] [ ro ] [ se ] [ set ] [ st ] [ T ] [ th ] [ ve ]