Pages that link to "Item:Q600247"
From MaRDI portal
The following pages link to The complexity of computing the permanent (Q600247):
Displaying 50 items.
- Visibility testing and counting for uncertain segments (Q2420576) (← links)
- Perfect matchings on a type of lattices with toroidal boundary (Q2422643) (← links)
- Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems (Q2428688) (← links)
- Some algebraic identities for the \({\alpha}\)-permanent (Q2435549) (← links)
- The graph isomorphism problem and approximate categories (Q2437326) (← links)
- Permanental partition models and Markovian Gibbs structures (Q2440363) (← links)
- A note on the permanental roots of bipartite graphs (Q2442268) (← links)
- Tropical bounds for eigenvalues of matrices (Q2442372) (← links)
- On the frontiers of polynomial computations in tropical geometry (Q2457404) (← links)
- On variable-weighted exact satisfiability problems (Q2462633) (← links)
- Solving \#SAT using vertex covers (Q2464035) (← links)
- The complexity of two problems on arithmetic circuits (Q2465637) (← links)
- Algorithms for modular counting of roots of multivariate polynomials (Q2482732) (← links)
- Counting perfect matchings in \(n\)-extendable graphs (Q2483418) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- Graph Isomorphism is in SPP (Q2495656) (← links)
- Computational aspects of mining maximal frequent patterns (Q2508965) (← links)
- On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients (Q2509196) (← links)
- Pfaffian orientations and perfect matchings of scale-free networks (Q2514127) (← links)
- Bayesian incentive compatibility via matchings (Q2516250) (← links)
- Efficient learning algorithms yield circuit lower bounds (Q2517822) (← links)
- Subtractive reductions and complete problems for counting complexity classes (Q2566034) (← links)
- On the values of permanents of (0, 1) circulant matrices with three ones per row (Q2568378) (← links)
- A common algebraic description for probabilistic and quantum computations (Q2575744) (← links)
- Parameterized counting problems (Q2576944) (← links)
- Computing the permanent modulo a prime power (Q2628281) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- Satisfiability with index dependency (Q2637283) (← links)
- Monomials, multilinearity and identity testing in simple read-restricted circuits (Q2637354) (← links)
- Relativized counting classes: Relations among thresholds, parity, and mods (Q2638771) (← links)
- Dempster's rule of combination is {\#}P-complete (Q2638783) (← links)
- Boolean circuits versus arithmetic circuits (Q2639101) (← links)
- Counting lattice vectors (Q2643017) (← links)
- Phase transitions of PP-complete satisfiability problems (Q2643309) (← links)
- The complexity of computational problems about Nash equilibria in symmetric win-lose games (Q2659767) (← links)
- The price of defense (Q2663706) (← links)
- Pure Nash equilibria in a generalization of congestion games allowing resource failures (Q2670923) (← links)
- The complexity of regex crosswords (Q2672653) (← links)
- On the hardness of approximate reasoning (Q2674206) (← links)
- Probabilistic nonunitary gate in imaginary time evolution (Q2690483) (← links)
- Volume of convex polytopes equals mixed volume of simplices (Q2694010) (← links)
- Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes (Q2695474) (← links)
- NIKE from affine determinant programs (Q2697912) (← links)
- Enumeration of perfect matchings of the Cartesian products of graphs (Q2699650) (← links)
- Efficient computation of the permanent of a sparse matrix (Q2740952) (← links)
- Brace generation (Q2781060) (← links)
- Estimating the permanent by importance sampling from a finite population (Q2784184) (← links)
- On the complexity of query result diversification (Q2790132) (← links)
- Poisson superposition processes (Q2794722) (← links)
- A complete dichotomy rises from the capture of vanishing signatures (Q2817798) (← links)
