We report numerical simulations on the number of local minima in the landscape of the Graph Bipartitioning Problem and provide an

Numerical estimates for the number of local optima of p-spin Hamiltonians with p=3,4,5, and 6 are reported. The data can be explained by means of a simple estimate in terms of the "correlation length" of the Hamiltonian.