Efficient algorithmic learning of the structure of permutation groups by examples
From MaRDI portal
Recommendations
Cites work
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A theory of the learnable
- An Algorithm for Finding the Blocks of a Permutation Group
- An O(logn) parallel connectivity algorithm
- An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph
- Dividing a Graph into Triconnected Components
- Fast parallel matrix and GCD computations
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Group-theoretic algorithms and graph isomorphism
- scientific article; zbMATH DE number 3968860 (Why is no real title available?)
- scientific article; zbMATH DE number 4108985 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- Isomorphism of graphs of bounded valence can be tested in polynomial time
Cited in
(3)
This page was built for publication: Efficient algorithmic learning of the structure of permutation groups by examples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963029)