Efficient algorithmic learning of the structure of permutation groups by examples
This paper discusses learning algorithms for ascertaining membership, inclusion, and equality in permutation groups. The main results are randomized learning algorithms which take a random generator set of a fixed group G ≤ S n as input. We discuss randomized algorithms for learning the concepts of...
Gespeichert in:
| Veröffentlicht in: | Computers & mathematics with applications (1987) 1999, Vol.37 (10), p.105-132 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!