On the public citation graph

Decomposition of algebras over finite fields and number fields

https://doi.org/10.1007/bf01272520
0 signed · 46 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1967.tb03174.xopenalex-snapshot
Factoring Polynomials Over Finite Fields
inferredcites →https://doi.org/10.1007/978-1-4757-0163-0openalex-snapshot
Associative Algebras
inferredcites →https://doi.org/10.1007/bf01272075openalex-snapshot
Algorithmic properties of maximal orders in simple algebras over Q
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf02579205openalex-snapshot
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
inferredcites →https://doi.org/10.1016/0020-0190(84)90018-8openalex-snapshot
On computing the determinant in small parallel time using a small number of processors
inferredcites →https://doi.org/10.1016/0022-0000(85)90043-1openalex-snapshot
Irreducibility of multivariate polynomials
inferredcites →https://doi.org/10.1016/0041-5553(64)90132-6openalex-snapshot
Representation theory of finite groups and associative algebras
inferredcites →https://doi.org/10.1016/0196-6774(88)90014-4openalex-snapshot
Zero divisors in quaternion algebras
inferredcites →https://doi.org/10.1016/b978-0-12-741245-0.50007-5openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1016/s0019-9958(82)90766-5openalex-snapshot
Fast parallel matrix and GCD computations
inferredcites →https://doi.org/10.1063/1.1664689openalex-snapshot
New Methods for Reduction of Group Representations. II
inferredcites →https://doi.org/10.1063/1.1664785openalex-snapshot
New Methods for Reduction of Group Representations. IV
inferredcites →https://doi.org/10.1063/1.1665028openalex-snapshot
New Methods for Reduction of Group Representations. III
inferredcites →https://doi.org/10.1063/1.1704141openalex-snapshot
New Methods for Reduction of Group Representations Using an Extension of Schur's Lemma
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0276200-xopenalex-snapshot
Factoring polynomials over large finite fields
inferredcites →https://doi.org/10.1090/s0025-5718-1981-0606517-5openalex-snapshot
A New Algorithm for Factoring Polynomials Over Finite Fields
inferredcites →https://doi.org/10.1090/s0025-5718-1990-1035925-1openalex-snapshot
Computing irreducible representations of finite groups
inferredcites →https://doi.org/10.1137/0209024openalex-snapshot
Probabilistic Algorithms in Finite Fields
inferredcites →https://doi.org/10.1137/0213050openalex-snapshot
Parallel Algorithms for Algebraic Problems
inferredcites →https://doi.org/10.1137/0214015openalex-snapshot
Factoring Polynomials over Algebraic Number Fields
inferredcites →https://doi.org/10.1145/22145.22162openalex-snapshot
Polynomial time solutions of some problems of computational algebra
inferredcites →https://doi.org/10.1145/28395.28438openalex-snapshot
Simple algebras are difficult
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.1145/800204.806285openalex-snapshot
Numerical methods for reduction of group representations
inferredcites →https://doi.org/10.2307/2311038openalex-snapshot
Representation Theory of Finite Groups and Associative Algebras.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-12558-5_2openalex-snapshot
Computational Arithmetic of Modular Forms
inferred← citeshttps://doi.org/10.1007/bf01200061openalex-snapshot
Decompositions of algebras over ? and ?
inferred← citeshttps://doi.org/10.1007/bf01272075openalex-snapshot
Algorithmic properties of maximal orders in simple algebras over Q
inferred← citeshttps://doi.org/10.1007/bf01438277openalex-snapshot
Decomposition of algebras overF q (X 1,...,X m )
inferred← citeshttps://doi.org/10.1007/s10958-017-3371-yopenalex-snapshot
Cryptographic Algorithms on Groups and Algebras
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2010.04.031openalex-snapshot
Irreducibility testing of finite nilpotent linear groups
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2012.09.031openalex-snapshot
Computing generators of the unit group of an integral abelian group ring
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2015.03.033openalex-snapshot
A note on locality of algebras
inferred← citeshttps://doi.org/10.1016/s0022-4049(97)00010-8openalex-snapshot
Finding the radical of an algebra of linear transformations
inferred← citeshttps://doi.org/10.1016/s0924-6509(00)80037-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1080/00927872.2020.1859521openalex-snapshot
Maximal subgroup growth of some metabelian groups
inferred← citeshttps://doi.org/10.1137/1.9781611975031.152openalex-snapshot
Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing
inferred← citeshttps://doi.org/10.1142/s1230161219500100openalex-snapshot
Reducibility Criteria and a Construction Method for the Analysis of Open Quantum Systems
inferred← citeshttps://doi.org/10.1142/s1793557122501418openalex-snapshot
Algebraic reduction methods and their applications to matrix continued fractions
inferred← citeshttps://doi.org/10.1145/1277548.1277574openalex-snapshot
The isomorphism problem for cyclic algebras and an application
inferred← citeshttps://doi.org/10.1145/345542.345620openalex-snapshot
Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract)
inferred← citeshttps://doi.org/10.1145/3476446.3535503openalex-snapshot
Symbolic-Numeric Factorization of Differential Operators
inferred← citeshttps://doi.org/10.13025/16198openalex-snapshot
Algorithms for Nilpotent Linear Groups
inferred← citeshttps://doi.org/10.48550/arxiv.1809.04645openalex-snapshot
Computational Arithmetic of Modular Forms (Course notes)
inferred← citeshttps://doi.org/10.7169/facm/2100openalex-snapshot
Some algebraic methods for analysing matrix continued fractions
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.