Pages that link to "Item:Q2674206"
From MaRDI portal
The following pages link to On the hardness of approximate reasoning (Q2674206):
Displayed 30 items.
- Approximating the least hypervolume contributor: NP-hard in general, but fast in practice (Q418034) (← links)
- The consequences of eliminating NP solutions (Q458458) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Disjunctive closures for knowledge compilation (Q460617) (← links)
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- \(P\)-top-\(k\) queries in a probabilistic framework from information extraction models (Q660968) (← links)
- Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks (Q814531) (← links)
- Complexity results for explanations in the structural-model approach (Q814579) (← links)
- Computing the fault tolerance of multi-agent deployment (Q835818) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- Approximating the volume of unions and intersections of high-dimensional geometric objects (Q982950) (← links)
- Understanding the scalability of Bayesian network inference using clique tree growth curves (Q991030) (← links)
- The number of independent sets in unicyclic graphs with a given diameter (Q1028107) (← links)
- Defaults and relevance in model-based reasoning (Q1127354) (← links)
- Permissive planning: Extending classical planning to uncertain task domains. (Q1399128) (← links)
- Semantics and complexity of abduction from default theories (Q1402749) (← links)
- Evaluation of Bayesian networks with flexible state-space abstraction methods (Q1603306) (← links)
- Tree decompositions with small cost (Q1764801) (← links)
- Complexity results for structure-based causality. (Q1852862) (← links)
- Algorithms for propositional model counting (Q2266937) (← links)
- Approximate algorithms for credal networks with binary variables (Q2379306) (← links)
- On probabilistic inference by weighted model counting (Q2389636) (← links)
- Expressive probabilistic description logics (Q2389639) (← links)
- Understanding the role of noise in stochastic local search: analysis and experiments (Q2389642) (← links)
- Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering (Q2457595) (← links)
- The number of independent sets in unicyclic graphs (Q2576351) (← links)
- Phase transitions of PP-complete satisfiability problems (Q2643309) (← links)
- Algorithms for Propositional Model Counting (Q3498488) (← links)
- Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting (Q5387627) (← links)
- A probabilistic approach to solving crossword puzzles (Q5958200) (← links)