Boning Meng

Orcid: 0009-0006-0088-1639

According to our database1, Boning Meng authored at least 8 papers between 2025 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
The Counting General Dominating Set Framework.
CoRR, March, 2026

Exponential time complexity for contracting tensor networks.
Comput. J., 2026

2025
Dichotomies for #CSP on graphs that forbid a clique as a minor.
CoRR, April, 2025

The FP<sup>NP</sup> versus ♯P dichotomy for ♯EO.
CoRR, February, 2025

The FPᴺᴾ versus #P Dichotomy for #EO.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Matchgate Signatures Under Variable Permutations.
Proceedings of the 36th International Symposium on Algorithms and Computation, 2025

P-Time Algorithms for Typical #EO Problems.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

From an Odd Arity Signature to a Holant Dichotomy.
Proceedings of the 40th Computational Complexity Conference, 2025


  Loading...