Pages that link to "Item:Q600247"
From MaRDI portal
The following pages link to The complexity of computing the permanent (Q600247):
Displaying 50 items.
- An extended tree-width notion for directed graphs related to the computation of permanents (Q2254501) (← links)
- Arithmetic matrix operations that preserve conversion (Q2255512) (← links)
- Algorithms for propositional model counting (Q2266937) (← links)
- Improved approximations for the Erlang loss model (Q2269482) (← links)
- Solution counting algorithms for constraint-centered search heuristics (Q2272161) (← links)
- Query evaluation on a database given by a random graph (Q2272222) (← links)
- Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants (Q2272599) (← links)
- Some extremal graphs with respect to permanental sum (Q2272664) (← links)
- Tropicalization, symmetric polynomials, and complexity (Q2284971) (← links)
- The expectation value of the number of loops and the left-passage probability in the double-dimer model (Q2288119) (← links)
- Robustness of approval-based multiwinner voting rules (Q2290364) (← links)
- Permanent, determinant, and rank of bi-block graphs (Q2297337) (← links)
- Definability for model counting (Q2303508) (← links)
- Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs (Q2308511) (← links)
- Operator scaling: theory and applications (Q2309517) (← links)
- Generalized permanental polynomials of graphs (Q2311039) (← links)
- Vanishing of Littlewood-Richardson polynomials is in P (Q2311547) (← links)
- Algorithms and complexity for Turaev-Viro invariants (Q2316773) (← links)
- Strong inconsistency (Q2321259) (← links)
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence (Q2321260) (← links)
- On the complexity of inconsistency measurement (Q2321337) (← links)
- Matrix scaling and explicit doubly stochastic limits (Q2321351) (← links)
- Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
- On the normalized Laplacian permanental polynomial of a graph (Q2330380) (← links)
- On the permanental sum of graphs (Q2333188) (← links)
- Combinatorial properties of Farey graphs (Q2333787) (← links)
- Enumeration of perfect matchings of lattice graphs by Pfaffians (Q2335766) (← links)
- Oriented Euler complexes and signed perfect matchings (Q2340282) (← links)
- A complexity theory of constructible functions and sheaves (Q2340508) (← links)
- Construction of nonconvertible \((0,1)\) matrices (Q2342353) (← links)
- Noncommutativity makes determinants hard (Q2347802) (← links)
- Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case (Q2349096) (← links)
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees (Q2352911) (← links)
- On the linear classification of even and odd permutation matrices and the complexity of computing the permanent (Q2359079) (← links)
- On the bivariate permanent polynomials of graphs (Q2361557) (← links)
- On preprocessing techniques and their impact on propositional model counting (Q2362107) (← links)
- A lower bound for the determinantal complexity of a hypersurface (Q2362290) (← links)
- Convertible, nearly decomposable, and nearly reducible matrices (Q2365691) (← links)
- A hybrid algorithm for computing permanents of sparse matrices (Q2369215) (← links)
- Polynomial time algorithm for an optimal stable assignment with multiple partners (Q2373720) (← links)
- New upper bound for the \#3-SAT problem (Q2380029) (← links)
- A hybrid algorithm for multi-homogeneous Bézout number (Q2383696) (← links)
- Counting for satisfiability by inverting resolution (Q2386352) (← links)
- Efficient importance sampling for binary contingency tables (Q2389598) (← links)
- Rectangular Kronecker coefficients and plethysms in geometric complexity theory (Q2404629) (← links)
- Per-spectral characterizations of some bipartite graphs (Q2409785) (← links)
- On approximating the eigenvalues of stochastic matrices in probabilistic logspace (Q2410679) (← links)
- On the connection between interval size functions and path counting (Q2410681) (← links)
- A general purpose algorithm for counting simple cycles and simple paths of any length (Q2415361) (← links)
- The Pfaffian property of graphs on the Möbius strip based on topological resolution (Q2419230) (← links)
