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.
Board: Can submodularity be tested with polynomially many queries?
Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.
0 open issues, 0 that nobody works on, 0 worked on; 0 open pull requests.
main at cdf5116: no checks on it yet.