On the computational complexity of the abelian permutation group structure, membership and intersection problems (bibtex)
by Costas S. Iliopoulos
Abstract:
Reference:
On the computational complexity of the abelian permutation group structure, membership and intersection problems (Costas S. Iliopoulos), In Theoretical Computer Science, volume 56, 1988. ()
Bibtex Entry:
@string{tcs="Theoretical Computer Science"}
@ARTICLE{I88ComplexityAbelian,
  AUTHOR =       "Costas S. Iliopoulos",
  TITLE  =       "On the computational complexity of the abelian permutation group structure, membership and intersection problems",
  JOURNAL =      TCS,
  YEAR =         "1988",
  volume =       "56",
  number =       "",
  pages =        "211--222",
  month =        "",
  note =         "",
  abstract =     "",
  keywords =     "",
  source =       ""
}
Powered by bibtexbrowser