Jin-yi Cai, Pinyan Lu, Mingji Xia. A Computational Proof of Complexity of Some Restricted Counting Problems. In Jianer Chen, S. Barry Cooper, editors, Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings. Volume 5532 of Lecture Notes in Computer Science, pages 138-149, Springer, 2009. [doi]
@inproceedings{CaiLX09:0,
title = {A Computational Proof of Complexity of Some Restricted Counting Problems},
author = {Jin-yi Cai and Pinyan Lu and Mingji Xia},
year = {2009},
doi = {10.1007/978-3-642-02017-9_17},
url = {http://dx.doi.org/10.1007/978-3-642-02017-9_17},
researchr = {https://researchr.org/publication/CaiLX09%3A0},
cites = {0},
citedby = {0},
pages = {138-149},
booktitle = {Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings},
editor = {Jianer Chen and S. Barry Cooper},
volume = {5532},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-02016-2},
}