We prove that the pseudovariety of monoids of Krohn-Rhodescomplexity at most n is not finitely based for all n>0. Morespecifically, for each pair of positive integers n,k, weconstruct a monoid of complexity n+1, all of whose k-generatedsubmonoids have complexity at most n.