Pages that link to "Item:Q5932755"
From MaRDI portal
The following pages link to A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents (Q5932755):
Displaying 50 items.
- Computing the permanent of (some) complex matrices (Q285430) (← links)
- Hafnians, perfect matchings and Gaussian matrices (Q317488) (← links)
- On testing Hamiltonicity of graphs (Q468434) (← links)
- Relative entropy optimization and its applications (Q507310) (← links)
- An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs (Q620956) (← links)
- Calculation of the permanent of a sparse positive matrix (Q709358) (← links)
- Brunn--Minkowski inequalities for contingency tables and integer flows (Q876322) (← links)
- On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries (Q962158) (← links)
- Hamiltonian cycles in Dirac graphs (Q987558) (← links)
- A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor (Q1016541) (← links)
- Approximating the permanent via importance sampling with application to the dimer covering problem (Q1282386) (← links)
- On the hardness of approximating the permanent of structured matrices (Q1430572) (← links)
- Constructive non-commutative rank computation is in deterministic polynomial time (Q1630376) (← links)
- Measure concentration and the weak Pinsker property (Q1720271) (← links)
- Learning semidefinite regularizers (Q1740575) (← links)
- Concentration of permanent estimators for certain large matrices. (Q1879920) (← links)
- Classical complexity and quantum entanglement (Q1886316) (← links)
- A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix (Q1959434) (← links)
- Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling (Q2039246) (← links)
- Scaling matrices and counting the perfect matchings in graphs (Q2064289) (← links)
- Contention resolution, matrix scaling and fair allocation (Q2085755) (← links)
- Solution counting algorithms for constraint-centered search heuristics (Q2272161) (← links)
- Matrix scaling and explicit doubly stochastic limits (Q2321351) (← links)
- A general law of large permanent (Q2362303) (← links)
- Non-commutative Edmonds' problem and matrix semi-invariants (Q2410690) (← links)
- On the complexity of general matrix scaling and entropy minimization via the RAS algorithm (Q2465654) (← links)
- An upper bound for permanents of nonnegative matrices (Q2474496) (← links)
- Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications (Q2514145) (← links)
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) (Q2693046) (← links)
- Relative entropy relaxations for signomial optimization (Q2805708) (← links)
- A Note on Deterministic Poly-Time Algorithms for Partition Functions Associated with Boolean Matrices with Prescribed Row and Column Sums (Q2849938) (← links)
- Improved rank bounds for design matrices and a new proof of Kelly's theorem (Q2879417) (← links)
- Scaling a Unitary Matrix (Q2938191) (← links)
- An approximation algorithm for counting contingency tables (Q3057067) (← links)
- Bravely, Moderately: A Common Theme in Four Recent Works (Q3088192) (← links)
- Quantum computing and hidden variables (Q3102441) (← links)
- Computing the Partition Function for Perfect Matchings in a Hypergraph (Q3103630) (← links)
- Singular values of Gaussian matrices and permanent estimators (Q3467585) (← links)
- Solution Counting Algorithms for Constraint-Centered Search Heuristics (Q3523086) (← links)
- Scaling of symmetric matrices by positive diagonal congruence (Q3615518) (← links)
- Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. (Q4638110) (← links)
- Approximating permanents and hafnians (Q4645007) (← links)
- Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor (Q4705350) (← links)
- From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces (Q4994986) (← links)
- A Tight Analysis of Bethe Approximation for Permanent (Q5020728) (← links)
- Fractional Sylvester–Gallai theorems (Q5170981) (← links)
- Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling (Q5240418) (← links)
- Matrix permanent and quantum entanglement of permutation invariant states (Q5245782) (← links)
- Enumerating Contingency Tables via Random Permanents (Q5448988) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465859) (← links)
