Pages that link to "Item:Q600247"
From MaRDI portal
The following pages link to The complexity of computing the permanent (Q600247):
Displaying 50 items.
- Farrell polynomials on graphs of bounded tree width (Q1398293) (← links)
- An oracle builder's toolkit (Q1398366) (← 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)
- On the number of different permanents of some sparse (0,1)-circulant matrices. (Q1414708) (← links)
- An upper bound for the permanent of \((0,1)\)-matrices. (Q1418984) (← links)
- On the hardness of counting problems of complete mappings. (Q1426113) (← links)
- On the algebraic complexity of some families of coloured Tutte polynomials (Q1433009) (← links)
- Non-cancellative Boolean circuits: A generalization of monotone boolean circuits (Q1566723) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- Counting problems over the reals (Q1575534) (← links)
- Strong orientations without even directed circuits (Q1584319) (← links)
- Immanants and finite point processes (Q1584658) (← links)
- Approximating the number of monomer-dimer coverings of a lattice. (Q1593404) (← links)
- Voronoi-like nondeterministic partition of a lattice by collectives of finite automata (Q1596777) (← links)
- Some observations on holographic algorithms (Q1616615) (← links)
- The fewest clues problem (Q1623268) (← links)
- The computational complexity of calculating partition functions of optimal medians with Hamming distance (Q1631451) (← links)
- Kräuter conjecture on permanents is true (Q1633378) (← links)
- On blockwise symmetric matchgate signatures and higher domain \#CSP (Q1633804) (← links)
- Pisot unit generators in number fields (Q1635275) (← links)
- Block interpolation: a framework for tight exponential-time counting complexity (Q1640999) (← links)
- A stability result using the matrix norm to bound the permanent (Q1650024) (← links)
- The number of matrices with nonzero permanent over a finite field (Q1662013) (← links)
- On the complexity of energy storage problems (Q1662159) (← links)
- Sampling weighted perfect matchings on the square-octagon lattice (Q1675927) (← links)
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (Q1676361) (← links)
- Short rational generating functions for solving some families of fuzzy integer programming problems (Q1677650) (← links)
- On characteristic and permanent polynomials of a matrix (Q1678984) (← links)
- Ulrich complexity (Q1679674) (← links)
- Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
- Approximate counting in SMT and value estimation for probabilistic programs (Q1683928) (← links)
- A sufficient condition for Pfaffian graphs on the torus (Q1684942) (← links)
- The probabilistic minimum dominating set problem (Q1686054) (← links)
- On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions (Q1704571) (← links)
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket (Q1704581) (← links)
- The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
- Counting minimal transversals of \(\beta\)-acyclic hypergraphs (Q1713476) (← links)
- Pfaffian polyominos on the Klein bottle (Q1713983) (← links)
- Fine-grained dichotomies for the Tutte plane and Boolean \#CSP (Q1725642) (← links)
- Approximate inference in Bayesian networks: parameterized complexity results (Q1726381) (← links)
- Computing the permanental polynomials of graphs (Q1735410) (← links)
- Complexity classes and completeness in algebraic geometry (Q1740570) (← links)
- An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs (Q1743482) (← links)
- The complexity of counting models of linear-time temporal logic (Q1745344) (← links)
- Constructing graphs which are permanental cospectral and adjacency cospectral (Q1756130) (← links)
- On the generation of circuits and minimal forbidden sets (Q1769072) (← links)
- Counting models for 2SAT and 3SAT formulae (Q1770390) (← links)
- Matrix permanent inequalities for approximating joint assignment matrices in tracking systems (Q1771051) (← links)
- Computing the optimal partition of variables in multi-homogeneous homotopy methods (Q1774889) (← links)
