<?xml version="1.0" encoding="utf-8" standalone="yes" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Boning Meng | 清华大学计算机系量子软件研究中心</title>
    <link>https://quantum.cs.tsinghua.edu.cn/author/boning-meng/</link>
      <atom:link href="https://quantum.cs.tsinghua.edu.cn/author/boning-meng/index.xml" rel="self" type="application/rss+xml" />
    <description>Boning Meng</description>
    <generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>zh-Hans</language><lastBuildDate>Wed, 16 Sep 2026 00:00:00 +0000</lastBuildDate>
    <image>
      <url>https://quantum.cs.tsinghua.edu.cn/media/icon_hu_4bddb5895fb575d1.png</url>
      <title>Boning Meng</title>
      <link>https://quantum.cs.tsinghua.edu.cn/author/boning-meng/</link>
    </image>
    
    <item>
      <title>Hidden Circuits and Exact Counting in Ordered Graphs</title>
      <link>https://quantum.cs.tsinghua.edu.cn/publication/liu-2026-hidden-circuits-and-exact-counting-in-ordered-graphs/</link>
      <pubDate>Wed, 16 Sep 2026 00:00:00 +0000</pubDate>
      <guid>https://quantum.cs.tsinghua.edu.cn/publication/liu-2026-hidden-circuits-and-exact-counting-in-ordered-graphs/</guid>
      <description></description>
    </item>
    
    <item>
      <title>A Dichotomy for Complex Boolean Holant with Binary Disequality</title>
      <link>https://quantum.cs.tsinghua.edu.cn/publication/liu-2026-a-dichotomy-for-complex-boolean-holant-with-binary-disequality/</link>
      <pubDate>Mon, 31 Aug 2026 00:00:00 +0000</pubDate>
      <guid>https://quantum.cs.tsinghua.edu.cn/publication/liu-2026-a-dichotomy-for-complex-boolean-holant-with-binary-disequality/</guid>
      <description></description>
    </item>
    
    <item>
      <title>Bounded Relative Boundary Implies Narrow DNF Approximation</title>
      <link>https://quantum.cs.tsinghua.edu.cn/publication/liu-2026-bounded-relative-boundary-implies-narrow-dnf-approximation/</link>
      <pubDate>Mon, 31 Aug 2026 00:00:00 +0000</pubDate>
      <guid>https://quantum.cs.tsinghua.edu.cn/publication/liu-2026-bounded-relative-boundary-implies-narrow-dnf-approximation/</guid>
      <description></description>
    </item>
    
    <item>
      <title>Lower Bounds for Domination-Type Problems Parameterized by Rank-Width</title>
      <link>https://quantum.cs.tsinghua.edu.cn/publication/liu-2026-lower-bounds-for-domination-type-problems-parameterized-by-rank-width/</link>
      <pubDate>Wed, 19 Aug 2026 00:00:00 +0000</pubDate>
      <guid>https://quantum.cs.tsinghua.edu.cn/publication/liu-2026-lower-bounds-for-domination-type-problems-parameterized-by-rank-width/</guid>
      <description></description>
    </item>
    
    <item>
      <title>From Block Orthogonality to Decidability in Complex-Weighted Counting CSP</title>
      <link>https://quantum.cs.tsinghua.edu.cn/publication/liu-2026-from-block-orthogonality-to-decidability-in-complex-weighted-counting-csp/</link>
      <pubDate>Fri, 14 Aug 2026 00:00:00 +0000</pubDate>
      <guid>https://quantum.cs.tsinghua.edu.cn/publication/liu-2026-from-block-orthogonality-to-decidability-in-complex-weighted-counting-csp/</guid>
      <description></description>
    </item>
    
    <item>
      <title>A Full Complexity Dichotomy for Complex-Valued Boolean Holant Problems</title>
      <link>https://quantum.cs.tsinghua.edu.cn/publication/liu-undated-full-complexity-dichotomy-complex-valued-boolean-holant-problems/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://quantum.cs.tsinghua.edu.cn/publication/liu-undated-full-complexity-dichotomy-complex-valued-boolean-holant-problems/</guid>
      <description>&lt;p&gt;This manuscript is listed as a preprint on Chenghua Liu&amp;rsquo;s homepage. Neither the homepage nor the PDF title page specifies a publication date.&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>Independent Set Discovery on Biclique-Free Graphs Is Fixed-Parameter Tractable</title>
      <link>https://quantum.cs.tsinghua.edu.cn/publication/liu-undated-independent-set-discovery-biclique-free-graphs/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://quantum.cs.tsinghua.edu.cn/publication/liu-undated-independent-set-discovery-biclique-free-graphs/</guid>
      <description>&lt;p&gt;This manuscript is listed as a preprint on Chenghua Liu&amp;rsquo;s homepage. Neither the homepage nor the PDF title page specifies a publication date.&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>When Matchgate Base Collapse Fails: A Qutrit Trichotomy and Unbounded Exact Width</title>
      <link>https://quantum.cs.tsinghua.edu.cn/publication/liu-undated-matchgate-base-collapse-qutrit-trichotomy/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://quantum.cs.tsinghua.edu.cn/publication/liu-undated-matchgate-base-collapse-qutrit-trichotomy/</guid>
      <description>&lt;p&gt;This manuscript is listed as a preprint on Chenghua Liu&amp;rsquo;s homepage. Neither the homepage nor the PDF title page specifies a publication date.&lt;/p&gt;
</description>
    </item>
    
  </channel>
</rss>
