Pages that link to "Item:Q600247"

The following pages link to The complexity of computing the permanent (Q600247):

Displaying 50 items.

• Permanental sums of graphs of extreme sizes (Q2022135) (← links)
• The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
• Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
• Recent progress in combinatorial random matrix theory (Q2039767) (← links)
• Counting the number of perfect matchings, and generalized decision trees (Q2044128) (← links)
• Lower bounds for arithmetic circuits via the Hankel matrix (Q2051372) (← links)
• The opacity of backbones (Q2051797) (← links)
• The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs (Q2052128) (← links)
• Sharp bounds on the permanental sum of a graph (Q2053704) (← links)
• Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties) (Q2054204) (← links)
• Spanning tree constrained determinantal point processes are hard to (approximately) evaluate (Q2060533) (← links)
• Pfaffian pairs and parities: counting on linear matroid intersection and parity problems (Q2061881) (← links)
• On the permanent of a random symmetric matrix (Q2064039) (← links)
• Scaling matrices and counting the perfect matchings in graphs (Q2064289) (← links)
• A nondeterministic Turing machine variant to compute functions (Q2067632) (← links)
• Voting power on a graph connected political space with an application to decision-making in the council of the European Union (Q2068879) (← links)
• Computing the execution probability of jobs with replication in mixed-criticality schedules (Q2069250) (← links)
• On the expected number of perfect matchings in cubic planar graphs (Q2075311) (← links)
• Distance spectrum, 1-factor and vertex-disjoint cycles (Q2080240) (← links)
• Approximate weighted model integration on DNF structures (Q2082501) (← links)
• Query answering over inconsistent knowledge bases: a probabilistic approach (Q2084950) (← links)
• Implicit recursion-theoretic characterizations of counting classes (Q2085583) (← links)
• Colouring non-even digraphs (Q2094875) (← links)
• Limitations of sums of bounded read formulas and ABPs (Q2117084) (← links)
• Maximizing products of linear forms, and the permanent of positive semidefinite matrices (Q2133425) (← links)
• Efficient computation of permanents, with applications to boson sampling and random matrices (Q2133747) (← links)
• Further results on the star degree of graphs (Q2139789) (← links)
• On the hardness of the determinant: sum of regular set-multilinear circuits (Q2140523) (← links)
• Completeness, approximability and exponential time results for counting problems with easy decision version (Q2143122) (← links)
• Reduced word enumeration, complexity, and randomization (Q2144333) (← links)
• Factorially many maximum matchings close to the Erdős-Gallai bound (Q2152791) (← links)
• The Hafnian master theorem (Q2158281) (← links)
• On the complexity of finding shortest variable disjunction branch-and-bound proofs (Q2164707) (← links)
• Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions (Q2178373) (← links)
• Vanishing symmetric Kronecker coefficients (Q2181688) (← links)
• Circulant matrices and Galois-Togliatti systems (Q2184787) (← links)
• Syzygies of the apolar ideals of the determinant and permanent (Q2187740) (← links)
• \( \pm 1\)-matrices with vanishing permanent (Q2202846) (← links)
• Parameterized complexity of determinant and permanent (Q2207496) (← links)
• Handling and measuring inconsistency in non-monotonic logics (Q2211858) (← links)
• A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
• Algorithms for orbit closure separation for invariants and semi-invariants of matrices (Q2219886) (← links)
• Descriptive complexity of \#P functions: a new perspective (Q2220444) (← links)
• Counting polygon triangulations is hard (Q2223620) (← links)
• Computing the permanent of the Laplacian matrices of nonbipartite graphs (Q2230052) (← links)
• Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) (Q2232317) (← links)
• Computational complexity of flat and generic assumption-based argumentation, with and without probabilities (Q2238615) (← links)
• New width parameters for SAT and \#SAT (Q2238644) (← links)
• Open-world probabilistic databases: semantics, algorithms, complexity (Q2238646) (← links)
• Lee-Yang theorems and the complexity of computing averages (Q2249768) (← links)