Pages that link to "Item:Q3853129"

The following pages link to The Complexity of Enumeration and Reliability Problems (Q3853129):

Displaying 50 items.

• Approximately counting approximately-shortest paths in directed acyclic graphs (Q260255) (← links)
• The complexity of estimating min-entropy (Q260395) (← links)
• Random partition models and complementary clustering of Anglo-Saxon place-names (Q262348) (← links)
• On computing minimal independent support and its applications to sampling and counting (Q265701) (← links)
• The complexity of counting locally maximal satisfying assignments of Boolean CSPs (Q284575) (← links)
• The computational complexity of the reliability problem on distributed systems (Q287259) (← links)
• Sequential Monte Carlo for counting vertex covers in general graphs (Q294226) (← links)
• Generating and enumerating digitally convex sets of trees (Q295254) (← links)
• Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations (Q299048) (← links)
• Fast domino tileability (Q312152) (← links)
• Counting \(4 \times 4\) matrix partitions of graphs (Q313799) (← links)
• Holant problems for 3-regular graphs with complex edge functions (Q315538) (← links)
• Tractable counting of the answers to conjunctive queries (Q389242) (← links)
• Closest pair and the post office problem for stochastic points (Q390124) (← links)
• Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions (Q391089) (← links)
• The complexity of complex weighted Boolean \#CSP (Q395011) (← links)
• The complexity of generalized domino tilings (Q396923) (← links)
• Decomposition representations of logical equations in problems of inversion of discrete functions (Q404200) (← links)
• The complexity of weighted and unweighted \(\#\)CSP (Q414939) (← links)
• Sparse reliable graph backbones (Q418121) (← links)
• Probabilistic query answering over inconsistent databases (Q454142) (← links)
• The consequences of eliminating NP solutions (Q458458) (← links)
• Enumerating Hamiltonian cycles (Q463046) (← links)
• Counting problems and ranks of matrices (Q471924) (← links)
• Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
• A new lower bound for the number of perfect matchings of line graph (Q477656) (← links)
• A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs (Q477692) (← links)
• Counting independent sets in a tolerance graph (Q479039) (← links)
• Robust planning with incomplete domain models (Q514145) (← links)
• Approximately counting paths and cycles in a graph (Q516844) (← links)
• On the complexity of propositional and relational credal networks (Q518627) (← links)
• Stochastic enumeration method for counting trees (Q518856) (← links)
• The complexity of finding effectors (Q519899) (← links)
• Maximum matchings in scale-free networks with identical degree distribution (Q528496) (← links)
• Queries and materialized views on probabilistic databases (Q532366) (← links)
• Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
• Tight lower bounds on the ambiguity of strong, total, associative, one-way functions (Q596322) (← links)
• Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
• The complexity of computing the permanent (Q600247) (← links)
• Model checking in the modal \(\mu \)-calculus and generic solutions (Q633088) (← links)
• Mathematical aspects of concept analysis (Q676803) (← links)
• Note on complexity of computing the domination of binary systems (Q678860) (← links)
• On the complexity of generalized chromatic polynomials (Q679542) (← links)
• Computing residual connectedness reliability for restricted networks (Q686266) (← links)
• Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems (Q690466) (← links)
• Weak minimization of DFA -- an algorithm and applications (Q703502) (← links)
• Lower bounds and the hardness of counting properties (Q703531) (← links)
• Spanning trees of 3-uniform hypergraphs (Q720597) (← links)
• The parameterized complexity of \(k\)-edge induced subgraphs (Q729817) (← links)
• Counting independent sets in tree convex bipartite graphs (Q730492) (← links)