Immanant (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Immanant" in English language version.

refsWebsite
Global rank English rank
2nd place
2nd place
18th place
17th place

doi.org (Global: 2nd place; English: 2nd place)

  • Littlewood, D. E.; Richardson, A. R. (1934). "Group characters and algebras". Philosophical Transactions of the Royal Society A. 233 (721–730): 99–124. Bibcode:1934RSPTA.233...99L. doi:10.1098/rsta.1934.0015.
  • Valiant, Leslie G. (1979). "Completeness classes in algebra". Proceedings of the 11th Annual ACM Symposium on Theory of Computing (STOC '79). ACM. pp. 249–261. doi:10.1145/800135.804419.
  • Brylinski, Jean-Luc; Brylinski, Ranee (2003). "Complexity of computing the immanant". International Mathematics Research Notices (13): 717–727. doi:10.1155/S1073792803205057 (inactive 28 December 2025).{{cite journal}}: CS1 maint: DOI inactive as of December 2025 (link) CS1 maint: unflagged free DOI (link)
  • Curticapean, Radu (2021). "A full complexity dichotomy for immanant families". Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC '21). ACM. doi:10.1145/3406325.3451124.
  • Miklós, István; Riener, Cordian (2026). "#P-hardness proofs of matrix immanants evaluated on restricted matrices". Theoretical Computer Science. 1062 115660. doi:10.1016/j.tcs.2025.115660.

harvard.edu (Global: 18th place; English: 17th place)

ui.adsabs.harvard.edu

  • Littlewood, D. E.; Richardson, A. R. (1934). "Group characters and algebras". Philosophical Transactions of the Royal Society A. 233 (721–730): 99–124. Bibcode:1934RSPTA.233...99L. doi:10.1098/rsta.1934.0015.