Attempting the Impossible: Enumerating Extremal Submodular Functions for n = 6
Enumerating the extremal submodular functions defined on subsets of a fixed base set has only been done for base sets up to five elements. This paper reports the results of attempting to generate all such functions on a six-element base set. Using improved tools from polyhedral geometry, we have com...
Saved in:
Main Authors: | Elod P. Csirmaz, Laszlo Csirmaz |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2024-12-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/13/1/97 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Figuration, énumération, complétion : du descriptif
by: Florence Pellegrini
Published: (2018-03-01) -
Research on affine equivalence enumeration of the three families vectorial function
by: Feng YUAN, et al.
Published: (2017-11-01) -
Multiuser computation offloading for edge-cloud collaboration using submodular optimization
by: Bing LIANG, et al.
Published: (2020-10-01) -
Editorial: Emerging technologies for viability enumeration of live microorganisms
by: Hanan R. Shehata, et al.
Published: (2025-01-01) -
Effect of the difference enumeration attack on LowMC instances
by: Xinxin GE, et al.
Published: (2021-06-01)