The following pages link to Is submodularity testable? (Q472463):
Displaying 15 items.
- Testing Lipschitz functions on hypergrid domains (Q270014) (← links)
- Characterizing and recognizing generalized polymatroids (Q403645) (← links)
- Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems (Q900693) (← links)
- A non-extendibility certificate for submodularity and applications (Q2019511) (← links)
- On additive approximate submodularity (Q2672599) (← links)
- A note on the implications of approximate submodularity in discrete optimization (Q2678995) (← links)
- Recognizing Coverage Functions (Q2944461) (← links)
- (Q4638085) (← links)
- (Q5090383) (← links)
- (Q5140837) (← links)
- Testing convexity of figures under the uniform distribution (Q5381051) (← links)
- The Complexity of Partial Function Extension for Coverage Functions (Q5875484) (← links)
- Approximate F_2-Sketching of Valuation Functions (Q5875529) (← links)
- (Q6087218) (← links)
- Positivity and convexity in incomplete cooperative games (Q6638852) (← links)
