# On graph isomorphism over exponential word sizes

Is it known Graph isomorphism can be done in poly time if we allow exponential word sizes?

(Shamir's poly time Integer Factoring algorithm is over exponential word sizes).

• By exponential word size, you mean a RAM model where word length is a number of bits that is polynomial in the input? – usul Mar 1 '16 at 22:10
• @usul $not$ $quite$ In Shamirs algorithm we need exponential number of bits in word or else Shamir's algorithm would prove factoring is in $P$. – user39969 Mar 1 '16 at 22:11