跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.26602 · v1

An Efficient Algorithm for Matroid Cups

拟阵杯问题的一个高效算法

首次提交 2026-11-20 02:54
版本更新 2026-11-20 02:54
雷达观测 2026-11-20 12:52
arXiv ↗PDF ↗

摘要

We design a polynomial-time algorithm for matroid cups with O(1)O(1) discrepancy. Our matroid cups algorithm design consists of a sequence of reductions to simpler instances, culminating in O(n)O(n) instances of matroid cups where the matroid has rank 1.

AI 论文解读

基于摘要 · 非全文审阅

作者为拟阵杯(matroid cups)问题设计了一个多项式时间算法,并达到 O(1) 差异度。

正在读取账号与研究记录…

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-20 02:54 · 最新观测版本

An Efficient Algorithm for Matroid Cups

We design a polynomial-time algorithm for matroid cups with O(1)O(1) discrepancy. Our matroid cups algorithm design consists of a sequence of reductions to simpler instances, culminating in O(n)O(n) instances of matroid cups where the matroid has rank 1.

查看此版本解读 →查看此版本原文 ↗