A non-extendibility certificate for submodularity and applications

DOI10.1007/978-3-030-58150-3_49MaRDI QIDQ2019511zbMATH OpenOpenAlexFDO

Authors Umang Bhaskar, Gunjan Kumar

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)

Cites work

• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• Combinatorial auctions with decreasing marginal utilities
• Computational limitations on learning from examples
• Equilibrium Points in Nonzero-Sum n-Person Submodular Games
• Is submodularity testable?
• Lattice Theory: Foundation
• Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
• Minimizing a Submodular Function on a Lattice
• On Proximity-Oblivious Testing
• On the complexity of submodular function minimisation on diamonds
• Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids
• Self-testing/correcting with applications to numerical problems
• Supermodular functions on finite lattices
• Testing monotonicity

Cited in

(2)

• The Complexity of Partial Function Extension for Coverage Functions
• scientific article; zbMATH DE number 7765404 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019511)