Refined bounds for instance-based search complexity of counting and other #P problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5202 LNCS, Issue , 2008, Pages 576-581

  Otten, Lars ^a   Dechter, Rina ^a  

^a 5226 Donald Bren Hall   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; LEARNING ALGORITHMS;

PROBLEM INSTANCES; SEARCH ALGORITHMS; SEARCH COMPLEXITIES; SEARCH SPACES;

COMPUTER PROGRAMMING;

EID: 56449099342     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85958-1_45     Document Type: Conference Paper

References (7)

1. Dechter, R., Mateescu, R.: AND/OR Search Spaces for Graphical Models. Artificial Intelligence 171, 73-106 (2007)
2. Gogate, V., Dechter, R.: Approximate Counting by Sampling the Backtrack-free Search Space. In: Proceedings of AAAI 2007 (2007)
3. Gottlob, G., Leone. N., Scarcello. F.: A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence 124, 243-282 (2000)
4. Johnson, D.S.: Approximation algorithms for combinatorial problems. In: Proceedings of STOC 1973, pp. 38-49 (1973)
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)
6. Otten, L., Dechter, R.: Bounding Search Space Size via (Hyper) tree Decompositions. In: Proceedings of UAI 2008 (2008)
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)