scientific article; zbMATH DE number 7765404
From MaRDI portal
Publication:6087218
DOI10.4230/lipics.isaac.2020.46arXiv1812.05821MaRDI QIDQ6087218
Publication date: 14 November 2023
Full work available at URL: https://arxiv.org/abs/1812.05821
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Is submodularity testable?
- Convex functions on non-convex domains
- Families of finite sets in which no set is covered by the union of \(r\) others
- Recognizing graphic matroids
- Error-free and best-fit extensions of partially defined Boolean functions
- A non-extendibility certificate for submodularity and applications
- Bounds on the rate of disjunctive codes
- Combinatorial auctions with decreasing marginal utilities
- Two Randomized Mechanisms for Combinatorial Auctions
- Computational limitations on learning from examples
- Minimizing a Submodular Function on a Lattice
- On Testing Convexity and Submodularity
- On the Abstract Properties of Linear Dependence
- On Maximizing Welfare When Utility Functions Are Subadditive
- Analytical approach to parallel repetition
- Entanglement of Formation of an Arbitrary State of Two Qubits
- The complexity of satisfiability problems
- Learning submodular functions
- Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids
- The Complexity of Partial Function Extension for Coverage Functions
This page was built for publication:
