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.
Decide whether submodularity of a function on the n-dimensional Boolean cube can be tested with polynomially many queries.
shoal-catalog changed this problem (d1cbb60b3b19). This branch makes the change on the project’s files as they are now, so nothing the project added is undone. Merge what still holds.