Pages that link to "Item:Q3853129"

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

Displaying 50 items.

• 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)
• Counting linear extensions (Q1183942) (← links)
• Restricted relativizations of probabilistic polynomial time (Q1186606) (← links)
• A note on bounding \(k\)-terminal reliability (Q1186804) (← links)
• On integer points in polyhedra (Q1193530) (← links)
• Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P (Q1193633) (← links)
• Polynomial-time compression (Q1198955) (← links)
• A very hard log-space counting class (Q1208403) (← links)
• The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable (Q1272311) (← links)
• A catalog of minimally nonideal matrices (Q1298742) (← links)
• The computational complexity of knot and matroid polynomials (Q1313843) (← links)
• The maximum clique problem (Q1318271) (← links)
• Computational complexity of loss networks (Q1318715) (← links)
• The complexity of computing maximal word functions (Q1321032) (← links)
• Extending matchings in claw-free graphs (Q1322284) (← links)
• Finding all the perfect matchings in bipartite graphs (Q1324433) (← links)
• Counting trees in a graph is \(\# \text{P}\)-complete (Q1332763) (← links)
• Simple characterizations of \(P(\# P)\) and complete problems (Q1333395) (← links)
• On the equivalence in complexity among three computation problems on maximum number of edge-disjoint \(s\)-\(t\) paths in a probabilistic graph (Q1334642) (← links)
• On closure properties of GapP (Q1337146) (← links)
• Algorithms to count paths and cycles (Q1339379) (← links)
• The complexities of the coefficients of the Tutte polynomial (Q1346689) (← links)
• Querying disjunctive databases through nonmonotonic logics (Q1350535) (← links)
• A short certificate of the number of universal optimal strategies for stopping simple stochastic games (Q1350746) (← links)
• On the complexity of partially observed Markov decision processes (Q1351500) (← links)
• Polynomial-time inference of all valid implications for Horn and related formulae (Q1356205) (← links)
• Computing optimal assignments for residual network reliability (Q1363776) (← links)
• Metafinite model theory (Q1383163) (← links)
• Two-path subsets: Efficient counting and applications to performability analysis (Q1392544) (← links)
• The complexity of the characteristic and the minimal polynomial. (Q1401240) (← links)
• The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. (Q1401394) (← links)
• Linear-time algorithms for computing the reliability of bipartite and (\(\# \leqslant 2\)) star distributed computing systems. (Q1422361) (← links)
• The Go polynomials of a graph. (Q1426435) (← links)
• Bicycle dimension and special points of the Tutte polynomial (Q1569033) (← links)