Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice

DOI10.4230/LIPICS.ESA.2020.26MaRDI QIDQ5874494zbMATH OpenOpenAlexFDO

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/

zbMATH Keywords

alternating matrix spaces\(p\)-groups of class 2nd exponent \(p\)average-case algorithmMagna

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• The Alternating Algorithm in Uniformly Convex Spaces
• An Algorithm for Optimal ℓ₂ 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

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 475362 (Why is no real title available?)
• scientific article; zbMATH DE number 3303153 (Why is no real title available?)
• A fast isomorphism test for groups whose Lie algebra has genus 2
• Algorithms based on \(*\)-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
• Algorithms for group isomorphism via group extensions and cohomology
• Beating the generator-enumeration bound for \(p\)-group isomorphism
• CONSTRUCTING THE GROUP PRESERVING A SYSTEM OF FORMS
• Computing isometry groups of Hermitian maps
• Deterministic polynomial time algorithms for matrix completion problems
• General linear group action on tensors: a candidate for post-quantum cryptography
• Graph isomorphism in quasipolynomial time (extended abstract)
• Group-theoretic generalisations of vertex and edge connectivities
• Groups with Abelian Central Quotient Group
• Hypergraph isomorphism and structural equivalence of Boolean functions
• Isomorphism in expanding families of indistinguishable groups.
• Linear time algorithms for Abelian group isomorphism and related problems
• On Borel complexity of the isomorphism problems for graph related classes of Lie algebras and finite \(p\)-groups
• On the \(n\log{n}\) isomorphism technique (preliminary report)
• Random Graph Isomorphism
• The occurrence of finite groups in the automorphism group of nilpotent groups of class 2

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)