This is a preview of subscription content, log in to check access.
Buy single article
Instant unlimited access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
E. Berlekamp, Factoring polynomials over finite fields,Bell Syst. Tech. J. 46 (1967), 1853–1859.
A. Borodin, R. Fagin, J. Hopcroft, and M. Tompa, Decreasing the nesting depth of expressions involving square roots,J. Symbol. Comput. 1 (1985), 169–188.
D. Kozen and S. Landau, Polynomial decomposition algorithms,J. Symbol. Comput. 7 (1989), 445–456.
S. Landau, How to tangle with a nested radical,Math. Intell. 16, no. 2 (1994), 49–55.
S. Landau, Simplification of nested radicals,SIAM J. Comput. 21 (1992), 85–110.
S. Landau and G. Miller, Solvability by radicals is in polynomial time,J. Comput. Syst. Sci. 30(2) (1985), 179–208.
H.W. Lenstra, Jr., Algorithms in algebraic number theory,Bull. AMS 26(2) (1992), 211–244.
P. Pálfy, A polynomial bound for the orders of primitive solvable groups,J. Algebra 77 (1982), 127–137.
R. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public key cryptosystems,Communications of the ACM 21(1978), 120–126.
B.L. van der Waerden,Algebra, Frederick Ungar Publishing Co. (1977).
H. Zassenhaus, On Hensel factorization I,J. Number Theory 1 (1969), 291–311.
About this article
Cite this article
Landau, S. √2 +√3: four different views. The Mathematical Intelligencer 20, 55–60 (1998). https://doi.org/10.1007/BF03025229
- Galois Group
- Galois Theory
- Maximal Chain
- Splitting Field
- Irreducible Factor