Pages that link to "Item:Q600247"
From MaRDI portal
The following pages link to The complexity of computing the permanent (Q600247):
Displaying 50 items.
- Odd \(K_{3,3}\) subdivisions in bipartite graphs (Q256986) (← links)
- Approximately counting approximately-shortest paths in directed acyclic graphs (Q260255) (← links)
- The complexity of estimating min-entropy (Q260395) (← links)
- A dichotomy for real weighted Holant problems (Q260401) (← links)
- The minimal \(k\)-core problem for modeling \(k\)-assemblies (Q282678) (← links)
- The complexity of counting locally maximal satisfying assignments of Boolean CSPs (Q284575) (← links)
- On the skew-permanental polynomials of orientation graphs (Q284839) (← links)
- Computing the permanent of (some) complex matrices (Q285430) (← links)
- Binary determinantal complexity (Q286175) (← links)
- A permanent formula with many zero-valued terms (Q287124) (← links)
- Multi-boson correlation sampling (Q291571) (← links)
- Complexity versus stability for classes of propositional formulas (Q293437) (← links)
- Holant problems for 3-regular graphs with complex edge functions (Q315538) (← links)
- Hafnians, perfect matchings and Gaussian matrices (Q317488) (← links)
- Bandit online optimization over the permutahedron (Q329616) (← links)
- Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
- Stochastic enumeration method for counting NP-hard problems (Q352890) (← links)
- DNF sparsification and a faster deterministic counting algorithm (Q354649) (← links)
- Permanent versus determinant over a finite field (Q378689) (← links)
- Pfaffian graphs embedding on the torus (Q382787) (← links)
- Enumerating perfect matchings in \(n\)-cubes (Q382880) (← links)
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- A dichotomy in the complexity of counting database repairs (Q389240) (← links)
- Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions (Q391089) (← links)
- On testing monomials in multivariate polynomials (Q391220) (← links)
- The expected characteristic and permanental polynomials of the random Gram matrix (Q405292) (← links)
- Finding all maximally-matchable edges in a bipartite graph (Q418005) (← links)
- Approximating the least hypervolume contributor: NP-hard in general, but fast in practice (Q418034) (← links)
- Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient (Q438742) (← links)
- Computing the permanental polynomials of bipartite graphs by Pfaffian orientation (Q442233) (← links)
- Complexity and approximability of the cover polynomial (Q445242) (← links)
- The consequences of eliminating NP solutions (Q458458) (← links)
- On the Pólya conversion problem for permanents and determinants (Q459468) (← links)
- On testing Hamiltonicity of graphs (Q468434) (← links)
- Counting problems and ranks of matrices (Q471924) (← links)
- Cycle-maximal triangle-free graphs (Q472981) (← links)
- An upper bound on the number of high-dimensional permutations (Q485003) (← links)
- Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
- Per-spectral characterizations of graphs with extremal per-nullity (Q491098) (← links)
- Counting the number of perfect matchings in \(K_{5}\)-free graphs (Q503455) (← links)
- Relative entropy optimization and its applications (Q507310) (← links)
- On the permanents of circulant and degenerate Schur matrices (Q512073) (← links)
- Maximal independent sets in a generalisation of caterpillar graph (Q512892) (← links)
- Robust planning with incomplete domain models (Q514145) (← links)
- Approximately counting paths and cycles in a graph (Q516844) (← links)
- Finding a shortest non-zero path in group-labeled graphs via permanent computation (Q524371) (← links)
- Maximum matchings in scale-free networks with identical degree distribution (Q528496) (← links)
- Leveraging belief propagation, backtrack search, and statistics for model counting (Q545553) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Exponentially many perfect matchings in cubic graphs (Q555602) (← links)
