跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+979新增论文
+781其中 AI 相关
+119已有论文修订
+97新增 AI 导读

arXiv 最近完成扫描:2026-11-20 08:48 · 全站最近入库:2026-11-20 19:58各信源进度 →

统计口径与数据新鲜度

统计 2026-11-19 22:52 — 2026-11-20 22:52(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-20 08:48最近发现新增版本:2026-11-20 19:58库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

28,961 已收录论文24,030 AI 相关8,912 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 08:46(北京时间)
新论文 · v1arXiv:2611.24548

Further simulations between tropical and linear programming

Edward A. Hirsch, Dmitrii Sluch

原文摘要

Propositional proof systems that apply various kinds of cuts to linear inequalities (such as Cutting Planes [CCT87] and Lift&Project [BCC93,Pud99,Das05]) or operate with disjunctions of linear inequalities (such as Res(CP) [Kra98] and Res(LP) [HK06]) have been in the focus of research for the past 30 years. Recently, tropical proof systems were introduced [AGH25]; they resemble the latter systems but differ from them in important respects. The relations between the traditional systems and the new tropical systems have remained largely unknown, and exponential lower bounds for tropical systems were limited to non-CNF examples. In this paper we prove several new polynomial simulations between these systems. To this end, we introduce Thr-Res (Threshold Resolution), a new natural daglike proof system operating on threshold conditions over the Boolean literals: lines asserting that at least s literals of a given multiset are true. Its main difference from CP is that the rounding rule (without it CP is incomplete) is replaced by a weaker rule that allows one to perform "resolution" steps with linear combinations beyond Boolean clauses; also, in its addition rules, Thr-Res resembles input resolution [Cha70]: a derived line is combined with an input clause or an axiom, whereas CP can add up any two derived lines. By varying the maximum value of s, one obtains systems ranging in strength from Resolution to MP-NSR, the static tropical (min-plus) proof system introduced in [AGH25]. As a consequence, we prove that MP-NSR is polynomially simulated by CP and L&P (even by their unary versions), which automatically yields exponential lower bounds on the size of MP-NSR proofs for formulas in CNF. We complement it with simulations in the converse direction: binary daglike MP-PCR (a dynamic version of MP-NSR) polynomially simulates L&P; it also polynomially simulates CP when division axioms are added.

cs.CC · math.OC