Advertisement

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

  • Lars Otten
  • Rina Dechter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5202)

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.

Keywords

Search Space Problem Instance Constraint Satisfaction Problem Tree Decomposition Search Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dechter, R., Mateescu, R.: AND/OR Search Spaces for Graphical Models. Artificial Intelligence 171, 73–106 (2007)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Gogate, V., Dechter, R.: Approximate Counting by Sampling the Backtrack-free Search Space. In: Proceedings of AAAI 2007 (2007)Google Scholar
  3. 3.
    Gottlob, G., Leone, N., Scarcello, F.: A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence 124, 243–282 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Johnson, D.S.: Approximation algorithms for combinatorial problems. In: Proceedings of STOC 1973, pp. 38–49 (1973)Google Scholar
  5. 5.
    Kjærulff, U.: Triangulation of Graphs – Algorithms Giving Small Total State Space. Research Report R-90-09, Dept. of Mathematics and Computer Science, Aalborg University (1990)Google Scholar
  6. 6.
    Otten, L., Dechter, R.: Bounding Search Space Size via (Hyper) tree Decompositions. In: Proceedings of UAI 2008 (2008)Google Scholar
  7. 7.
    Otten, L., Dechter, R.: Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems. Technical Report, University of California, Irvine (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Lars Otten
    • 1
  • Rina Dechter
    • 1
  1. 1.Bren School of Information and Computer SciencesUniversity of CaliforniaIrvineU.S.A.

Personalised recommendations