Information Technology Reference
In-Depth Information
[14] Brightwell, G., Scheinerman, E.: Representations of planar graphs. SIAM J. Discrete
Math. 6, 214-229 (1993)
[15] Ben-Or, M.: Lower bounds for algebraic computation trees. In: Proc. 15th Annu. Symp.
Theory of Computing, pp. 80-86 (1983)
[16] Yao, A.C.: Lower bounds for algebraic computation trees of functions with finite domains.
SIAM J. Comput. 20, 655-668 (1991)
[17] Shoup, V.: A Computational Introduction to Number Theory and Algebra. CambridgeUniv.
Press (2009)
[18] Baker, R.C., Harman, G.: Shifted primes withoutlarge prime factors. Acta Arith. 83, 331-
361 (1998)
[19] Cox, D.A.: Galois Theory. 2nd edn. Pure and Applied Mathematics. Wiley (2012)
[20] Jacobson, N.: Basic Algebra I, 2nd edn. Dover Books on Mathematics. Dover (2012)
[21] Stackel, P.: Arithmetische Eigenschaften ganzer Funktionen (Fortsetzung.).J.ReineAngew.
Math. 148, 101-112 (1918)
