- DocumentoPolynomial time algorithms for permutation groups- Luks, Furst, Hopcroft.pdfcaricato daLeah Webb
- DocumentoMonte-Carlo algorithms in Poly testing Babai 1979.pdfcaricato daLeah Webb
- DocumentoEugene M. Luks -- Isomorphism of graphs of bounded valence can be tested in polynomial time.pdfcaricato daLeah Webb
- DocumentoPolynomial Time Algorithms for Permutation Groups- Luks, Furst, Hopcroftcaricato daLeah Webb
- DocumentoMonte-Carlo Algorithms in Poly Testing Babai 1979caricato daLeah Webb
- DocumentoEugene M. Luks -- Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Timecaricato daLeah Webb
- DocumentoSem1 Calendarcaricato daLeah Webb
- Documentoiitm_feescaricato daLeah Webb
- Documentoiitm_fees documentcaricato daLeah Webb
- Documentoiitm_feescaricato daLeah Webb
- Documentoiitm_feescaricato daLeah Webb