Pages that link to "Item:Q3853129"
From MaRDI portal
The following pages link to The Complexity of Enumeration and Reliability Problems (Q3853129):
Displayed 50 items.
- 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)
- Mathematical aspects of concept analysis (Q676803) (← links)
- Note on complexity of computing the domination of binary systems (Q678860) (← links)
- Computing residual connectedness reliability for restricted networks (Q686266) (← links)
- Weak minimization of DFA -- an algorithm and applications (Q703502) (← links)
- Lower bounds and the hardness of counting properties (Q703531) (← links)
- A note on enumerative counting (Q809598) (← links)
- Version spaces and the consistency problem (Q814597) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Counting solutions to binomial complete intersections (Q870342) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- Counting problems and algebraic formal power series in noncommuting variables (Q910245) (← links)
- A logic-based analysis of Dempster-Shafer theory (Q918733) (← links)
- On the complexity of ranking (Q920620) (← links)
- Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs (Q935835) (← links)
- Complexity of DNF minimization and isomorphism testing for monotone formulas (Q939444) (← links)
- End-to-end availability-dependent pricing of network services (Q940846) (← links)
- Some decision and counting problems of the Duquenne-Guigues basis of implications (Q943835) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- Universal relations and {\#}P-completeness (Q954984) (← links)
- Random sampling of colourings of sparse random graphs with a constant number of colours (Q954987) (← links)
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) (← links)
- Generating 3-vertex connected spanning subgraphs (Q998366) (← links)
- Listing minimal edge-covers of intersecting families with applications to connectivity problems (Q1003760) (← links)
- The computational complexity of maximization and integration (Q1057267) (← links)
- The complexity of counting homeomorphs (Q1058852) (← links)
- On some natural complete operators (Q1064780) (← links)
- Monte-Carlo algorithms for the planar multiterminal network reliability problem (Q1079111) (← links)
- The complexity of colouring problems on dense graphs (Q1079363) (← links)
- An analysis of Monte Carlo algorithms for counting problems (Q1083200) (← links)
- On the construction of parallel computers from various basis of Boolean functions (Q1083204) (← links)
- Approximation to measurable functions and its relation to probabilistic computation (Q1088659) (← links)
- Some observations on the connection between counting and recursion (Q1098837) (← links)
- Enumerative techniques for solving some nonconvex global optimization problems (Q1102205) (← links)
- Parallel computation with threshold functions (Q1107324) (← links)
- An application of the planar separator theorem to counting problems (Q1108031) (← links)
- Edge-packings of graphs and network reliability (Q1111461) (← links)
- Lower bounds on two-terminal network reliability (Q1116878) (← links)
- Approximate counting, uniform generation and rapidly mixing Markov chains (Q1117955) (← links)
- A Bayesian approach to relevance in game playing (Q1127355) (← links)
- Combinatorial problems over power sets (Q1143948) (← links)
- Sulla complessita di alcuni problemi di conteggio (Q1151037) (← links)
- On counting problems and the polynomial-time hierarchy (Q1171880) (← links)
- Enumerating the cycles of a digraph: a new preprocessing strategy (Q1172396) (← links)
- The complexity of controlled selection (Q1173958) (← links)
- The complexity of computing the number of strings of given length in context-free languages (Q1178713) (← links)
- The computational complexity of abduction (Q1182159) (← links)