Boning Meng

最新发表

Chenghua Liu, Boning Meng (2026). Hidden Circuits and Exact Counting in Ordered Graphs. arXiv（预印本）.

PDF 引用 arXiv

Chenghua Liu, Boning Meng (2026). A Dichotomy for Complex Boolean Holant with Binary Disequality. arXiv（预印本）.

PDF 引用 arXiv

Chenghua Liu, Boning Meng (2026). Bounded Relative Boundary Implies Narrow DNF Approximation. arXiv（预印本）.

PDF 引用 arXiv

Chenghua Liu, Boning Meng (2026). Lower Bounds for Domination-Type Problems Parameterized by Rank-Width. arXiv（预印本）.

PDF 引用 arXiv

Chenghua Liu, Boning Meng (2026). From Block Orthogonality to Decidability in Complex-Weighted Counting CSP. arXiv（预印本）.

PDF 引用 arXiv

Chenghua Liu, Boning Meng, Juqiu Wang A Full Complexity Dichotomy for Complex-Valued Boolean Holant Problems. Undated manuscript (author-hosted preprint; publication date unknown).

PDF 引用 Author Homepage

Chenghua Liu, Boning Meng Independent Set Discovery on Biclique-Free Graphs Is Fixed-Parameter Tractable. Undated manuscript (author-hosted preprint; publication date unknown).

PDF 引用 Author Homepage

Chenghua Liu, Boning Meng When Matchgate Base Collapse Fails: A Qutrit Trichotomy and Unbounded Exact Width. Undated manuscript (author-hosted preprint; publication date unknown).

PDF 引用 Author Homepage