<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Mathematic on Yukari's Blog</title><link>https://yukar.icu/column/mathematic/</link><description>Recent content in Mathematic on Yukari's Blog</description><generator>Hugo</generator><language>zh-cn</language><lastBuildDate>Sat, 24 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://yukar.icu/column/mathematic/index.xml" rel="self" type="application/rss+xml"/><item><title>拓扑</title><link>https://yukar.icu/posts/mathematic/identificationmap/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0000</pubDate><guid>https://yukar.icu/posts/mathematic/identificationmap/</guid><description>分治是将多项式复杂度优化为更低的多项式复杂度的算法：分治、合并，两者复杂度存在竞争关系。 1. Open/Closed Map2. Final Topology</description></item></channel></rss>