An Exponential Value-Oracle Lower Bound for \({k}\)-Submodular Function Minimization

Abstract. We give a simple family of [Formula: see text]-submodular functions for every fixed [Formula: see text], showing that minimization in the value-oracle model requires exponentially many oracle queries.

Authors

Institutions

Publication Details

Journal
SIAM Journal on Discrete Mathematics
Published
2026-09-18
DOI
https://doi.org/10.1137/26m1889795
Primary Topic
Complexity and Algorithms in Graphs
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

An Exponential Value-Oracle Lower Bound for \({k}\)-Submodular Function Minimization

Yuichi Yoshida
SIAM Journal on Discrete Mathematics
Complexity and Algorithms in Graphs
article

An Exponential Value-Oracle Lower Bound for \({k}\)-Submodular Function Minimization

Yuichi Yoshida
article en

Abstract

Abstract. We give a simple family of [Formula: see text]-submodular functions for every fixed [Formula: see text], showing that minimization in the value-oracle model requires exponentially many oracle queries.

SIAM Journal on Discrete MathematicsVol. 40(3)
National Institute of Informatics (JP)
Japan Society for the Promotion of Science
Openalex Percentile: Top 9%
Complexity and Algorithms in Graphs
DOISourceOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

An Exponential Value-Oracle Lower Bound for \({k}\)-Submodular Function Minimization — Yuichi Yoshida · SIAM Journal on Discrete Mathematics (2026) | TGRS Research Map | TGRS