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.
- 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)
- A second step towards complexity-theoretic analogs of Rice's Theorem (Q1575716) (← links)
- Domination of cyclic monotone \((s,t)\)-graphs (Q1581443) (← links)
- Some observations on holographic algorithms (Q1616615) (← links)
- The fewest clues problem (Q1623268) (← links)
- Counting independent sets and maximal independent sets in some subclasses of bipartite graphs (Q1627864) (← links)
- On blockwise symmetric matchgate signatures and higher domain \#CSP (Q1633804) (← links)
- Simulating cardinal preferences in Boolean games: a proof technique (Q1641024) (← links)
- The stochastic stability of decentralized matching on a graph (Q1651273) (← links)
- Linear-time algorithms for counting independent sets in bipartite permutation graphs (Q1675914) (← links)
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (Q1676361) (← links)
- The computational complexity of QoS measures for orchestrations. The computational complexity of QoS measures (Q1679522) (← links)
- Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket (Q1704581) (← links)
- Simple linear-time algorithms for counting independent sets in distance-hereditary graphs (Q1706124) (← links)
- The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
- Number of spanning trees of different products of complete and complete bipartite graphs (Q1719484) (← links)
- Stochastic enumeration with importance sampling (Q1739341) (← links)