Planning and learning in permutation groups
暂无分享,去创建一个
[1] Richard M. Karp,et al. On the Security of Ping-Pong Protocols , 1982, Inf. Control..
[2] J. A. Todd,et al. A practical method for enumerating cosets of a finite abstract group , 1936 .
[3] Oded Goldreich,et al. The Minimum-Length Generator Sequence Problem is NP-Hard , 1981, J. Algorithms.
[4] N. S. Mendelsohn. An Algorithmic Solution for a Word Problem in Group Theory , 1964, Canadian Journal of Mathematics.
[5] Dana Angluin,et al. Inference of Reversible Languages , 1982, JACM.
[6] C. Sims. Computational methods in the study of permutation groups , 1970 .
[7] Adi Shamir,et al. A T=O(2n/2), S=O(2n/4) Algorithm for Certain NP-Complete Problems , 1981, SIAM J. Comput..
[8] Mark Jerrum. The Complexity of Finding Minimum-Length Generator Sequences (Extended Abstract) , 1984, ICALP.
[9] John E. Hopcroft,et al. Polynomial-time algorithms for permutation groups , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[10] Danny Dolev,et al. On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).