Planning and learning in permutation groups
- 1 January 1989
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 274-279
- https://doi.org/10.1109/sfcs.1989.63490
Abstract
Planning is defined as the problem of synthesizing a desired behavior from given basic operations, and learning is defined as the dual problem of analyzing a given behavior to determine the unknown basic operations. Algorithms for solving these problems in the context of invertible operations on finite-state environments are developed. In addition to their obvious artificial intelligence applications, the algorithms can efficiently find the shortest way to solve Rubik's cube, test ping-pong protocols, and solve systems of equations over permutation groups.Keywords
This publication has 10 references indexed in Scilit:
- The complexity of finding minimum-length generator sequencesTheoretical Computer Science, 1985
- On the security of public key protocolsIEEE Transactions on Information Theory, 1983
- On the security of ping-pong protocolsInformation and Control, 1982
- Inference of Reversible LanguagesJournal of the ACM, 1982
- The minimum-length generator sequence problem is NP-hardJournal of Algorithms, 1981
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete ProblemsSIAM Journal on Computing, 1981
- Polynomial-time algorithms for permutation groupsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Computational methods in the study of permutation groups††This research was supported in part by the National Science Foundation.Published by Elsevier ,1970
- An Algorithmic Solution for a Word Problem in Group TheoryCanadian Journal of Mathematics, 1964
- A practical method for enumerating cosets of a finite abstract groupProceedings of the Edinburgh Mathematical Society, 1936