Approximately counting maximal independent set is equivalent to #SAT
<|reference_start|>Approximately counting maximal independent set is equivalent to #SAT: A maximal independent set is an independent set that is not a subset of any other independent set. It is also the key problem of mathematics, computer science, and other fields. A counting problem is a type of computational problem that associated with the number of solutions. Besides, counting problems help us better understand several fields such as algorithm analysis, complexity theory, artificial intelligence, etc. The problem of counting maximal independent sets is #P-complete. So it is natural to think about approximate counting for maximal independent sets problem. In this article, we study the complexity of approximately counting maximal independent sets. Specifically, we are the first to prove that the #MIS problem is AP-interreducible with the #SAT of a given general graph.<|reference_end|>
@article{zhang2024approximately,
    title={Approximately counting maximal independent set is equivalent to #SAT},
    author={Hao Zhang, Tonghua Su},
    journal={arXiv preprint arXiv:2409.07035},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.07035},
    primaryClass={cs.CC math.CO}
}