ISOMORPHISM OF GRAPHS OF BOUNDED VALENCE CAN BE TESTED IN POLYNOMIAL-TIME

[1] ATKINSON MD, 1975, MATH COMPUT, V29, P911, DOI 10.1090/S0025-5718-1975-0367030-3

[2] BABAI L, 1981, P C FUND COMP THY SZ

[3] BABAI L, UNPUB SUBEXPONENTIAL

[4] BABAI L, UNPUB ORDER PRIMITIV

[5] BABAI L A S O, 1979, MONTE CARLO ALGORITH

[6] FINITE PERMUTATION-GROUPS AND FINITE SIMPLE-GROUPS [J]. BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 1981, 13 (JAN) : 1 - 22

[7] Carter R., 1964, J ALGEBRA, V1, P139

[8] Furst M., 1980, 21st Annual Symposium on Foundations of Computer Science, P36, DOI 10.1109/SFCS.1980.34

[9] FURST M, 1980, 80426 CORN U TECH RE

[10] HALL M, 1959, THEORY GROUPS

[1] ATKINSON MD, 1975, MATH COMPUT, V29, P911, DOI 10.1090/S0025-5718-1975-0367030-3

[2] BABAI L, 1981, P C FUND COMP THY SZ

[3] BABAI L, UNPUB SUBEXPONENTIAL

[4] BABAI L, UNPUB ORDER PRIMITIV

[5] BABAI L A S O, 1979, MONTE CARLO ALGORITH

[6] FINITE PERMUTATION-GROUPS AND FINITE SIMPLE-GROUPS [J]. BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 1981, 13 (JAN) : 1 - 22

[7] Carter R., 1964, J ALGEBRA, V1, P139

[8] Furst M., 1980, 21st Annual Symposium on Foundations of Computer Science, P36, DOI 10.1109/SFCS.1980.34

[9] FURST M, 1980, 80426 CORN U TECH RE

[10] HALL M, 1959, THEORY GROUPS