Join
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.
| 1 | { |
| 2 | "domain": "computer-science", |
| 3 | "topics": [ |
| 4 | "algorithms-complexity" |
| 5 | ], |
| 6 | "type": "algorithm", |
| 7 | "also": [ |
| 8 | "proof" |
| 9 | ], |
| 10 | "source": { |
| 11 | "key": "sublinear", |
| 12 | "name": "Sublinear.info", |
| 13 | "url": "https://sublinear.info/37", |
| 14 | "id": "37", |
| 15 | "curator": "Sublinear.info editors", |
| 16 | "poser": "C. Seshadhri", |
| 17 | "status": "open", |
| 18 | "as_of": "2026-10-20", |
| 19 | "catalog": "0521c19bbd38" |
| 20 | } |
| 21 | } |