Efficient algorithmic learning of the structure of permutation groups by examples
From MaRDI portal
Publication:1963029
DOI10.1016/S0898-1221(99)00129-7zbMath0941.68116OpenAlexW2054366515MaRDI QIDQ1963029
Publication date: 20 January 2000
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0898-1221(99)00129-7
Symbolic computation and algebraic computation (68W30) Learning and adaptive systems in artificial intelligence (68T05) Permutation groups (20B99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Group-theoretic algorithms and graph isomorphism
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- A theory of the learnable
- An O(logn) parallel connectivity algorithm
- An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph
- An Algorithm for Finding the Blocks of a Permutation Group
- Fast parallel matrix and GCD computations
- Dividing a Graph into Triconnected Components
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations