Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems

Authors:
Lars Otten;Rina Dechter
Affiliations:
Bren School of Information and Computer Sciences, University of California, Irvine, U.S.A. CA 92697-3425;Bren School of Information and Computer Sciences, University of California, Irvine, U.S.A. CA 92697-3425
Venue:
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Year:
2008

Citing 4
Cited 0

A comparison of structural CSP decomposition methods

Artificial Intelligence
Approximation algorithms for combinatorial problems

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
AND/OR search spaces for graphical models

Artificial Intelligence
Approximate counting by sampling the backtrack-free search space

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present measures for bounding the instance-based complexity of AND/OR search algorithms for solution counting and related #Pproblems. 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.