Can submodularity be tested with polynomially many queries?

Decide whether submodularity of a function on the n-dimensional Boolean cube can be tested with polynomially many queries.