Lars Otten, Rina Dechter. Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems. In Peter J. Stuckey, editor, Principles and Practice of Constraint Programming, 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings. Volume 5202 of Lecture Notes in Computer Science, pages 576-581, Springer, 2008. [doi]
@inproceedings{OttenD08:0,
title = {Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems},
author = {Lars Otten and Rina Dechter},
year = {2008},
doi = {10.1007/978-3-540-85958-1_45},
url = {http://dx.doi.org/10.1007/978-3-540-85958-1_45},
tags = {rule-based, search},
researchr = {https://researchr.org/publication/OttenD08%3A0},
cites = {0},
citedby = {0},
pages = {576-581},
booktitle = {Principles and Practice of Constraint Programming, 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings},
editor = {Peter J. Stuckey},
volume = {5202},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-85957-4},
}