3 papers
cs.GT2026
How Hard Is It to Rig a Tournament When Few Players Can Beat or Be Beaten by the Favorite?
Zhonghao Wang, Junqiang Peng, Yuxi Liu +1
In knockout tournaments, players compete in successive rounds, with losers eliminated and winners advancing until a single champion remains. Given a tournament digraph , which e…
cs.DS2025
New Algorithms for #2-SAT and #3-SAT
Junqiang Peng, Zimo Sheng, Mingyu Xiao
The #2-SAT and #3-SAT problems involve counting the number of satisfying assignments (also called models) for instances of 2-SAT and 3-SAT, respectively. In 2010, Zhou et al. propo…
cs.AI2025
Systematic Parameter Decision in Approximate Model Counting
Jinping Lei, Toru Takisaka, Junqiang Peng +1
This paper proposes a novel approach to determining the internal parameters of the hashing-based approximate model counting algorithm . In this problem, the chos…