<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Linear-Programming on As it was</title>
    <link>https://galoishlee.github.io/tags/linear-programming/</link>
    <description>Recent content in Linear-Programming on As it was</description>
    <generator>Hugo</generator>
    <language>zh-CN</language>
    <managingEditor>maocred@gmail.com (Halois)</managingEditor>
    <webMaster>maocred@gmail.com (Halois)</webMaster>
    <copyright>This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.</copyright>
    <lastBuildDate>Fri, 14 Aug 2026 14:13:02 +0800</lastBuildDate>
    <atom:link href="https://galoishlee.github.io/tags/linear-programming/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Automated Coppersmith 的渐近界：线性规划对偶与一个精确 SageMath 实现</title>
      <link>https://galoishlee.github.io/auto-coppersmith-lp-asymptotics/</link>
      <pubDate>Thu, 13 Aug 2026 12:00:00 +0800</pubDate><author>maocred@gmail.com (Halois)</author>
      <guid>https://galoishlee.github.io/auto-coppersmith-lp-asymptotics/</guid>
      <description>&lt;blockquote&gt;&#xA;&lt;p&gt;Reading: Ding et al., ePrint 2026/1027。本文只处理一个问题：Automated Coppersmith 的 shift 选择为什么在缩放后变成线性规划，以及 Theorem 4 中的渐近系数如何写成 \(P\) 上的积分。&lt;sup id=&#34;fnref:1&#34;&gt;&lt;a href=&#34;#fn:1&#34; class=&#34;footnote-ref&#34; role=&#34;doc-noteref&#34;&gt;1&lt;/a&gt;&lt;/sup&gt;&lt;/p&gt;&#xA;&lt;/blockquote&gt;&#xA;&lt;p&gt;主链为：shift 可行性 → 逐点 ILP → 缩放 LP → 对偶分片 → Ehrhart 积分。实现部分检查 &lt;code&gt;auto-copper&lt;/code&gt; 如何用精确有理数计算对偶顶点、满维单元格与积分，并用有限参数例子核对 Algorithm 2。&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
