A non-extendibility certificate for submodularity and applications

DOI10.1007/978-3-030-58150-3_49OpenAlexW3082433379MaRDI QIDQ2019511

Gunjan Kumar, Umang Bhaskar

Publication date: 21 April 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-58150-3_49

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Related Items (2)

Unnamed Item ⋮ The Complexity of Partial Function Extension for Coverage Functions

Cites Work

• Unnamed Item
• Is submodularity testable?
• On the complexity of submodular function minimisation on diamonds
• Self-testing/correcting with applications to numerical problems
• Supermodular functions on finite lattices
• Combinatorial auctions with decreasing marginal utilities
• On Proximity-Oblivious Testing
• Lattice Theory: Foundation
• Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
• Computational limitations on learning from examples
• Equilibrium Points in Nonzero-Sum n-Person Submodular Games
• Minimizing a Submodular Function on a Lattice
• Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids
• Testing monotonicity

This page was built for publication: A non-extendibility certificate for submodularity and applications