Applications of dimensionality reduction and exponential sums to graph automorphism
From MaRDI portal
(Redirected from Publication:551192)
Recommendations
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 1670646 (Why is no real title available?)
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 477971 (Why is no real title available?)
- scientific article; zbMATH DE number 3424665 (Why is no real title available?)
- Algorithms and Data Structures
- Algorithms in real algebraic geometry
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Graph isomorphism and equality of simplices
- Invariant Subspaces of Matrices with Applications
- Matrix Analysis
- On determining the congruence of point sets in \(d\) dimensions
- On the complexity of polytope isomorphism problems
- Proofs from THE BOOK
- Simplices and spectra of graphs
- Some NP-Complete Problems Similar to Graph Isomorphism
- Testing the congruence of d-dimensional point sets
- The complexity of modular graph automorphism
- Two reductions of graph isomorphism to problems on polynomials
This page was built for publication: Applications of dimensionality reduction and exponential sums to graph automorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q551192)