Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice
From MaRDI portal
Publication:5874494
DOI10.4230/LIPICS.ESA.2020.26OpenAlexW3081999078MaRDI QIDQ5874494FDOQ5874494
Authors: Yinan Li, Youming Qiao, Peter A. Brooksbank, James B. Wilson
Publication date: 7 February 2023
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/12892/pdf/LIPIcs-ESA-2020-26.pdf/
Recommendations
- The Alternating Algorithm in Uniformly Convex Spaces
- An Algorithm for Optimal ℓ2 Scaling of Matrices
- scientific article; zbMATH DE number 2148414
- Algorithms in convex analysis to fit \(\ell_ p\)-distance matrices
- Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes
- On the von Neumann alternating algorithm in Hilbert space
- scientific article; zbMATH DE number 1424235
- An iterative algorithm for approximate orthogonalisation of symmetric matrices
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
Cites Work
- Title not available (Why is that?)
- Random Graph Isomorphism
- Hypergraph isomorphism and structural equivalence of Boolean functions
- Title not available (Why is that?)
- Isomorphism in expanding families of indistinguishable groups.
- Computing isometry groups of Hermitian maps
- The occurrence of finite groups in the automorphism group of nilpotent groups of class 2
- On the \(n\log{n}\) isomorphism technique (preliminary report)
- Linear time algorithms for Abelian group isomorphism and related problems
- CONSTRUCTING THE GROUP PRESERVING A SYSTEM OF FORMS
- Beating the generator-enumeration bound for \(p\)-group isomorphism
- A fast isomorphism test for groups whose Lie algebra has genus 2
- Title not available (Why is that?)
- Groups with Abelian Central Quotient Group
- Graph isomorphism in quasipolynomial time (extended abstract)
- Deterministic polynomial time algorithms for matrix completion problems
- Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing
- Group-theoretic generalisations of vertex and edge connectivities
- General linear group action on tensors: a candidate for post-quantum cryptography
- Algorithms for group isomorphism via group extensions and cohomology
- On Borel complexity of the isomorphism problems for graph related classes of Lie algebras and finite \(p\)-groups
Cited In (5)
- Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- Tensor isomorphism by conjugacy of Lie algebras
- Faster isomorphism for \(p\)-groups of class 2 and exponent \(p\)
- On the Baer-Lovász-Tutte construction of groups from graphs: isomorphism types and homomorphism notions
This page was built for publication: Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874494)