Pages that link to "Item:Q600247"
From MaRDI portal
The following pages link to The complexity of computing the permanent (Q600247):
Displaying 50 items.
- Approximation theorems for random permanents and associated stochastic processes (Q1780983) (← links)
- Computational complexity and 3-manifolds and zombies (Q1785090) (← links)
- The ubiquitous Ewens sampling formula (Q1790306) (← links)
- The complexity of error metrics (Q1799556) (← links)
- Enumerative counting is hard (Q1822963) (← links)
- Subcomplete generalizations of graph isomorphism (Q1838044) (← links)
- An analysis of Monte Carlo algorithm for estimating the permanent (Q1842570) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- Unification algorithms cannot be combined in polynomial time. (Q1854364) (← links)
- Computation of sparse circulant permanents via determinants (Q1855364) (← links)
- Permanents of woven matrices (Q1870074) (← links)
- One complexity theorist's view of quantum computing (Q1870556) (← links)
- Affine projections of symmetric polynomials. (Q1872730) (← links)
- Fast computation of discrete invariants associated to a differential rational mapping (Q1878484) (← links)
- Concentration of permanent estimators for certain large matrices. (Q1879920) (← links)
- Graphs determined by polynomial invariants (Q1885023) (← links)
- The complexity to compute the Euler characteristic of complex varieties (Q1886973) (← links)
- The combinatorial approach yields an NC algorithm for computing Pfaffians (Q1887034) (← links)
- Limit theorems for random permanents with exchangeable structure (Q1888330) (← links)
- Singular values, doubly stochastic matrices, and applications (Q1893086) (← links)
- A loop-free algorithm for generating the linear extensions of a poset (Q1917670) (← links)
- A mildly exponential approximation algorithm for the permanent (Q1923855) (← links)
- On the number of Eulerian orientations of a graph (Q1923856) (← links)
- On deterministic approximation of DNF (Q1923857) (← links)
- Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\) (Q1926033) (← links)
- Holographic reduction, interpolation and hardness (Q1926111) (← links)
- On the Gibson barrier for the Pólya problem (Q1930200) (← links)
- Holographic algorithms by Fibonacci gates (Q1931762) (← links)
- The complexity of approximating bounded-degree Boolean \(\#\)CSP (Q1932171) (← links)
- On the characterizing properties of the permanental polynomials of graphs (Q1932591) (← links)
- Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials (Q1944393) (← links)
- Small space analogues of Valiant's classes and the limitations of skew formulas (Q1947043) (← links)
- Permanent formulae from the Veronesean (Q1952259) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix (Q1959434) (← links)
- Cook's versus Valiant's hypothesis (Q1978701) (← links)
- Coloring invariants of knots and links are often intractable (Q1983547) (← links)
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs (Q1987232) (← links)
- On the (signless) Laplacian permanental polynomials of graphs (Q2000570) (← links)
- Many associated primes of powers of primes (Q2001430) (← links)
- Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial (Q2001606) (← links)
- The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← links)
- Non-deterministic weighted automata evaluated over Markov chains (Q2009651) (← links)
- Unicyclic graphs with second largest and second smallest permanental sums (Q2010574) (← links)
- Counting substrate cycles in topologically restricted metabolic networks (Q2011645) (← links)
- Counting maximal independent sets in directed path graphs (Q2015155) (← links)
- Some results on certain generalized circulant matrices (Q2017613) (← links)
- On measures of space over real and complex numbers (Q2019497) (← links)
- An efficient algorithm for deciding vanishing of Schubert polynomial coefficients (Q2020382) (← links)
- Converting immanants on skew-symmetric matrices (Q2020648) (← links)
