On the automorphism groups of strongly regular graphs. I
DOI10.1145/2554797.2554830zbMATH Open1365.05202OpenAlexW2064091274MaRDI QIDQ2988892FDOQ2988892
Authors: László Babai 
Publication date: 19 May 2017
Published in: Proceedings of the 5th conference on Innovations in theoretical computer science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2554797.2554830
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)
Cites Work
- A hierarchy of polynomial time lattice basis reduction algorithms
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Evaluating Branching Programs on Encrypted Data
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Title not available (Why is that?)
- (Leveled) fully homomorphic encryption without bootstrapping
- On lattices, learning with errors, random linear codes, and cryptography
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Bounds for Width Two Branching Programs
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- New lattice-based cryptographic constructions
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Toward basing fully homomorphic encryption on worst-case hardness
Cited In (17)
- A characterization of Johnson and Hamming graphs and proof of Babai's conjecture
- On the spectral gap and the automorphism group of distance-regular graphs
- On the automorphism groups of rank-4 primitive coherent configurations
- The QAP-polytope and the graph isomorphism problem
- \(r\)-regular families of graph automorphisms
- Applications of dimensionality reduction and exponential sums to graph automorphism
- On automorphisms of strongly regular graphs with $ \lambda=0$, $ \mu=2$
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
- Vertex-primitive digraphs with large fixity
- On fixity of arc-transitive graphs
- On the automorphism groups of strongly regular graphs. II.
- Strongly regular graphs with non-trivial automorphisms
- Title not available (Why is that?)
- On the complexity of identifying strongly regular graphs
- Faster canonical forms for primitive coherent configurations (extended abstract)
- On the number of fixed points of automorphisms of vertex-transitive graphs
- On the Baer-Lovász-Tutte construction of groups from graphs: isomorphism types and homomorphism notions
This page was built for publication: On the automorphism groups of strongly regular graphs. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988892)
