Abstract
We present measures for bounding the instance-based complexity of AND/OR search algorithms for solution counting and related #P problems. To this end we estimate the size of the search space, with special consideration given to the impact of determinism in a problem. The resulting schemes are evaluated empirically on a variety of problem instances and shown to be quite powerful. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Otten, L., & Dechter, R. (2008). Refined bounds for instance-based search complexity of counting and other #P problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5202 LNCS, pp. 576–581). https://doi.org/10.1007/978-3-540-85958-1_45
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
