Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,468,577 papers from all fields of science
Search
Sign In
Create Free Account
Zassenhaus algorithm
In mathematics, the Zassenhaus algorithmis a method to calculate a basis for the intersection and sum of two subspaces of a vector space.It is named…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Basis (linear algebra)
Computer algebra system
Gröbner basis
Kernel (linear algebra)
Expand
Broader (1)
Linear algebra
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
Deterministic root finding in finite fields
L. D. Feo
,
C. Petit
,
Michaël Quisquater
ACCA
2015
Corpus ID: 16569462
Finding roots of polynomials with coefficients in a finite field is a special instance of the polynomial factorization problem…
Expand
2003
2003
Data organization for broadcasting in mobile computing
P. Sumari
,
Rozaida Mohd Darus
,
H. Kamarulhaili
International Conference on Geometric Modeling…
2003
Corpus ID: 8491087
The rapidly expanding technology of cellular communications, wireless LAN (local area network), wireless data networks and…
Expand
1997
1997
A generalisation of the Cantor-Zassenhaus algorithm
C. Hidber
Computing
1997
Corpus ID: 20986890
We generalise the Cantor-Zassenhaus algorithm for factoring polynomials over finite fields. The generalisation yields a class of…
Expand
1991
1991
Practical factorization of univariate polynomials over finite fields
V. Trevisan
,
Paul S. Wang
International Symposium on Symbolic and Algebraic…
1991
Corpus ID: 6861036
Research presented fort to establish state-of-the-art Kent State University “ Kent, Ohio 44242-0001 here is part of an…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE