Journal of Symbolic Computation
|
|
- Cora Cross
- 5 years ago
- Views:
Transcription
1 Journal of Symbolic Computation 50 (013) 55 Contents lists available at SciVerse ScienceDirect Journal of Symbolic Computation On the evaluation of multivariate polynomials over finite fields E. Ballico a,m.elia b,m.sala a a Dipartimento di Matematica, Università degli Studi di Trento, Via Sommarive 14, 3813 Trento, Italy b Dipartimento di Elettronica, Politecnico di Torino, Corso Duca degli Abruzzi 4, 1019 Torino, Italy article info abstract Article history: Received 5 April 01 Accepted 1 July 01 Available online 1 August 01 A method to evaluate multivariate polynomials over a finite field is described and its multiplicative complexity is discussed. 01 Elsevier B.V. All rights reserved. Keywords: Multiplicative complexity Complexity Multivariate polynomials Finite field Computational algebra 1. Introduction Many applications require the evaluation of multivariate polynomials over finite fields. For instance, the so-called affine-variety codes (also called evaluation or functional or algebraic geometry codes) are obtained by evaluating a finite-dimensional linear subspace of F q [x 1,...,x r ] at a finite set S Fq r. See for example Borodin and Munro (195, Section.1), Geil (008), Hansen (001), Little (008), Winograd (1980). When the degree n of the polynomials is small, and/or the number r of variables is also small, the direct computation is efficient; however, as n, orr, or both become large, evaluation becomes an issue. The case of univariate polynomials has been extensively considered, see e.g. Paterson and Stockmeyer (193), Pan (19) and some recent papers (Elia et al. 011, in press). In Pan (19) and Winograd (1980) there are sharp lower bounds for the complexity over any infinite field K. At a first approximation, each coefficient of the polynomial a i may be seen as an indeterminate, and the objective is to find the minimal number of multiplications involving the a i s. These contributions show that each coefficient must be counted, except the constant one: the proof scheme (over an infinite field K) is so powerful that this lower bound is also an upper bound, even when addresses: edoardo.ballico@unitn.it (E. Ballico), elia@polito.it (M. Elia), maxsalacodes@gmail.com (M. Sala) /$ see front matter 01 Elsevier B.V. All rights reserved.
2 5 E. Ballico et al. / Journal of Symbolic Computation 50 (013) 55 the other multiplications, i.e. the operations involving the coordinates of the point P at which we evaluate the polynomial are taken into account. Fix an integer r 1. Over an infinite field K the complexity of the evaluation of a degree n polynomial in x 1,...,x r is O(n r ), even counting the multiplication by the coefficients of the polynomial (Carnicer and Gasca, 1990; de Boor and Ros, 199; Schumaker and Volk, 198; Lodha and Goldman, 199). The problem addressed here is different: multiplications by 0 and 1 are not counted in the computational model; instead the number of multiplications needed to evaluate the powers of the variables is counted. Hence, if the coefficients are in F, the multiplications by the coefficients are not counted, while the powers of the variables, possibly in an extension F m, are evaluated, and their computation, to be performed in this field extension, is the only contribution to the total number (hopefully the minimum number) of multiplications. The same model is applied to evaluate f F q [x 1,...,x r ] at P F q m. It is emphasized that this model is applicable only to finite field extensions. An evaluation method for multivariate polynomials is proposed which significantly reduces the multiplicative complexity (in this model) and hence the computational burden. Let p(x 1,...,x r ) be a polynomial of degree n in r variables with coefficients in a finite field F p s ; its number of terms is denoted by M r (n) = ( ) n+r r. Consider the evaluation of p(x1,...,x r ) at a point a = (α 1,...,α r ) F r p m, where m is divisible by s. A direct evaluation of p(α 1,...,α r ) is obtained from the evaluation of the M r (n) distinct monomials, a task requiring M r (n) r 1 multiplications. M r (n) 1 multiplications, and a total number A r (n) = M r (n) 1 of additions, are thus performed. The total number of multiplications required is P r (n) = M r (n) r = nr r! + r + 1 (r 1)! nr r. However, different computing strategies can require a significantly smaller number of multiplications. With the aim of developing some of these strategies, the polynomial p(x 1,...,x r ) is written as a sum s 1 p(x 1,...,x r ) = β i q i (x 1,...,x r ) (1) i=0 of s polynomials, where each q i (x 1,...,x r ) is a polynomial of degree n in r variables with coefficients in the prime field F p.thevaluep(a) can be obtained from the s values q i (α 1,...,α r ),s multiplications, and s additions in F p m. In these computations, β is represented as an element of F p m. Therefore, the analysis may be restricted to the evaluation at a point a F r p m of a polynomial q(x 1,...,x r ),inr variables, of degree n over F p. As pointed out in Elia et al. (in press,.1), the prime is particularly interesting, because of its occurrence in many practical applications, for example in error correction coding. Furthermore, in F multiplications are trivial. A description of the method in the easiest case, that is, over F and with two variables, is given. In Section 4, the description is generalized to any setting.. The computational model Two kinds of multiplications are involved in the computations: field multiplications in the coefficient field F p s and in the extension F p m. Cost 1 is assigned to all of these, except for the multiplications by 0 or 1, which are assigned cost 0. Remark 1. Some multiplications may cost much less, such as squares in characteristic, but they will be treated as cost 1. As customary, cost 0 is assigned to any data reading. Field sums could be counted separately, but the aim is to minimize the number of field multiplications, and so the value M r (n) is used as implicit upper bound for sums, that is, twice the sum of all monomials.
3 E. Ballico et al. / Journal of Symbolic Computation 50 (013) 55 5 An ordering on monomials is chosen, for example the degree lexicographical ordering (see Mora, 009b), so that input data can be modeled as an F p s string, any entry corresponding to a polynomial coefficient. Remark. A well-established method to evaluate all monomials up to degree n at a given point is to start from degree-1 monomials and then iterate from degree-r monomials to degree-r + 1 monomials, since the computations of any degree-r + 1 monomial requires only one multiplication, once all degree-r monomials are memorized. It is remarked here that the algorithm accepts as input any polynomial of a given total degree, and so the estimates are worst-case complexity, which translates into considering dense polynomials. Clearly, other faster methods could be derived for special classes of polynomials, such as sparse polynomials or polynomials with a predetermined algebraic structure. The memory requirement of the methods will not be discussed, but it can easily be seen from an inspection of the following algorithms that it is negligible compared to the computational effort. 3. The case r =, p = A polynomial P(x, y) of degree n in variables over the binary field may be decomposed into a sum of 4 polynomials, as ( P(x, y) = P 0,0 x, y ) ( + xp 1,0 x, y ) ( + yp 0,1 x, y ) ( + xyp 1,1 x, y ) = P 0,0 (x, y) + xp 1,0 (x, y) + yp 0,1 (x, y) + xyp 1,1 (x, y), () where P i, j (x, y) are polynomials of degree n i j. Therefore the value of P(x, y) in the point a = (α 1, α ) F m can be obtained by computing the four numbers P i, j (α 1, α ), the monomial α 1 α, performing three products α 1 P 1,0 (α 1, α ), α P 0,1 (α 1, α ),andα 1 α P 1,1 (α 1, α ), and finally performing three additions. Observe that all P i, j s have the same possible monomials, i.e. all monomials of degree up to n. It is not necessary to store separately P 0,0, P 0,1, P 1,0, P 1,1, because the selection of any of these is obtained by a trivial indexing rule. The polynomials P i, j (α 1, α ) can be evaluated as sums of such monomials, which can be evaluated once for all. Therefore, P(α 1, α ) is obtained performing (see Remark ) atotalnumberof P r (n) = ( n +)( n +1) 3 n 8 multiplications, a figure considerably less than n as required by direct computation. However, the mechanism can be iterated, and the point is to find the number of steps yielding the maximum gain, that is to find the most convenient degree of the polynomials that should be directly evaluated. We have the following: Theorem 1. Let P(x, y) be a polynomial of degree n over F, its evaluation at a point (α 1, α ) F m performed by iterating the decomposition (), requires a number G (n,, L opt ) of products which asymptotically is G (n,, L opt ) c n, c < 5, where L opt, the number of iterations yielding the minimum of G (n,, L), is an integer included in the interval ( 1 ) ( ) + log 4 n + ɛ < L op < log 4 n + ɛ, where ɛ and ɛ are less than 1 and O( 1 n ).
4 58 E. Ballico et al. / Journal of Symbolic Computation 50 (013) 55 Proof. The polynomial P(x, y) is decomposed into the sum of 4 polynomials that are perfect squares over F, each of which is similarly decomposed. Let P (L,h) i, j (x, y) denote the polynomials at the L-step of this iterative process, with h varying from 1 to 4 L 1. The number of polynomials after L steps is 4 L, while their degrees are not greater than n.thevaluep(α L 1, α ) is obtained performing in reverse, the reconstruction process obtaining at each step the values P (l 1,h) i, (α j 1, α ) from the values P (l,h) i, (α j 1, α ), whereas the 4 L numbers P (L,h) i, (α j 1, α ), i, j {0, 1} and h = 0,...,4 L 1, are computed from the direct evaluation of M ( n ) monomials using M L ( n ) 3 multiplications. L Therefore the total number of multiplications necessary to obtain P(α 1, α ) is a sum of M ( n ) 3plus L the number of squares 4 ( 4 L ) 1 = [ 4 L + 4 L L L+1] ; 3 the number of multiplications of kind x i y j P i, j (α 1, α ) 4 L 1 = 3 [ 4 L L + +4 L L]. Thus the total number is: G (n,, L) = ( 4 L ) 1 + ( n +1)( n +) L L 3. 3 The number of products required to evaluate P(α 1, α ) is thus a function of L, and the values of L that correspond to local minima are specified by the conditions G (n,, L) G (n,, L 1) and G (n,, L) G (n,, L + 1), from which, it is straightforward to obtain the conditions 4 L 3 n 5 4 > n ( { }) ({ } { })( 3 n n n 3 L L 14 + L L L ({ } { }) n n ), 14 L L 4 L n 4 < 4n ( { } { }) 3 n n L L + L ({ } { } ) n n + ({ } { }) n n L L L L L where {x} denotes the fractional part of x. These inequalities show that there is only one minimum that corresponds to a value of L such that 1 + log 4 ( ) ( ) n + ɛ < L op < log 4 n + ɛ, where ɛ and ɛ are O( 1 n ). Therefore, the minimum value of G (n,, L) is asymptotically G (n,, L op ) c n where c is a constant less than 5. Remark 3. In computing the bounds, essentially each monomial is computed separately. Hence the approach appears very efficient for computing several polynomials at the same point. This is exploited in the computation of the required number of multiplications when the polynomial coefficients are in F s. An application of Eq. (1) and Theorem 1 would give the asymptotic estimate
5 E. Ballico et al. / Journal of Symbolic Computation 50 (013) G s(n,, L op ) c ns, since the evaluation of any q i would cost c n. However, the polynomials q i(x, y) can be evaluated contemporarily. Therefore, computing the power necessary to evaluate the polynomial at step L only once, this leads to a total number of required multiplications G s(n,, L) = s ( 4 L ) 1 + ( n +1)( n +) L L 3 3 because only the reconstruction operations need to be repeated s times. By repeating the argument outlined in the proof of Theorem 1, it is concluded that the optimal value of L depends also on s, and asymptotically the required value of multiplications is G s(n,, L op ) c n s. 4. The case r, p A polynomial P(x 1,...,x r ) of degree n, inr variables over the field F p, is simply decomposed into asumofp r polynomials, as P(x 1,...,x r ) = x i ( xi r r P p ) i 1,...,i r x 1,...,xp r i 1,...,i r {0,1,...,p 1} = x i ( xi r r P i1,...,i r (x 1,...,x r ) ) p (3) i 1,...,i r {0,1,...,p 1} where P i1,...,i r (x 1,...,x r ) is a polynomial of degree n i j. Therefore the polynomial P(x p 1,...,x r ) evaluated at the point a = (α 1,...,α r ) F r p m can be obtained from the evaluation of all polynomials P i1,...,i r (x 1,...,x r ) at a, by evaluating the p r monomials α i αi r r (which require p r r 1multiplications), performing p r computations of p-powers, combining these factors with p r multiplications, and finally summing all results. The minimum number of steps is obtained in the following theorem. Theorem. Let L opt be the number of steps of this method yielding the minimum number of products, G p (n, r, L op ), required to evaluate a polynomial of degree n in r variables, with coefficients in F p.thenl opt is an integer that asymptotically is included in the interval 1 + B + log p n L op 1 + B + log p n where B = 1 r log (p 1)(p r 1) p r!( p r 1), that is, L op is the integer closest to B + log p n. Asymptotically the minimum G p (n, r, L op ) is included in the interval: (p 1) pr 1 1 p r p r 1 r! n r < G p (n, r, L op )< p r (p 1) pr 1 1 p r 1 r! n r. Proof. Using Eq. (3) the polynomial P(x 1,...,x r ) evaluated at the point a = (α 1,...,α r ) F r p m be obtained from the evaluation of all P i1,...,i r (x 1,...,x r ) at a, byevaluatingp r monomials α i αi r r (which requires p r r 1 multiplications), computing p r p-powers, combining these factors with p r 1 multiplications, and finally performing the required additions. This procedure can be iterated: at each step the number of polynomials is multiplied by p r and their degrees are at least divided by p. Therefore, after L steps the number of polynomials is p rl and can
6 0 E. Ballico et al. / Journal of Symbolic Computation 50 (013) 55 their degrees are not greater than n. Once the p r numbers P p L i1,...,i r (α 1,...,α r ) are known, the total number of p-powers is p rl + p r(l 1) + + p r(l L+1) = pr ( p rl ) p r 1 1 and the number of products necessary to obtain P(α) is ( p r 1 )[ p r(l 1) + p r(l ) + + p r(l L)] = p rl 1, hence the total number of required multiplications is p r 1 ( p rl ) p r 1. 1 The total number of multiplications required to compute all the monomials in all polynomials arising at step L is M r ( n p L ) r 1, and further ( ) ) (p ) (M npl r r 1 products are necessary to provide every possible term occurring in the polynomials at step L. Asa consequence, the total number of multiplications G p (n, r, L) necessary to evaluate P(a) is G p (n, r, L) = pr 1 ( p rl ) ( ) ) p r 1 + (p 1) (M npl r r 1. 1 The optimal value L op giving the minimum G p (n, r, L op ) is now sought, and should be chosen from among the local optima given by the values of L such that G p (n, r, L) G p (n, r, L 1) and G p (n, r, L) G p (n, r, L + 1). Since ( ) n M r = 1 ( { n n p L r! p L p L }) r r ( 1 + j=1 j n p L { n p L } ), then M r ( n ) is an expression which is 1 p L r! ( n ) r + O( pl ) asymptotically in n; consequently the p L n asymptotic expression G p (n, r, L) = pr+1 1 p r 1 prl + 1 ( ) r n r! p L shows that L op is asymptotically identified by the chain of inequalities 1 (p 1)(p r 1)n r p r r!(p r p rl (p 1)(p op r 1)n r p r 1) r!(p r 1) which, written in the form 1 + B + log p n L op 1 + B + log p n, shows that the unique optimal value is the integer closest to B + log p n, where B = 1 r log (p 1)(p r 1) p r!(p r 1). The minimum number of multiplications is asymptotically included in the interval p r (p 1) pr 1 p r 1 1 r! n r < G p (n, r, L op )< p r (p 1) pr 1 p r 1 1 r! n r.
7 E. Ballico et al. / Journal of Symbolic Computation 50 (013) 55 1 Remark 4. The proofs begin by evaluating certain monomials. Hence they may be extended to other finite-dimensional linear subspaces ( of F p [x 1,...,x r ], simply by taking their dimension α as vector ) n+r space instead of the integer r. For a suitable linear space V in Theorem 3, a bound of order c3 α with c 3 p r+1 might be obtained. For instance, let V (r,n) be the linear subspace of F p [x 1,...,x r ] formed by all polynomials whose degree in each variable is at most n. Wehavedim(V (n, r)) = (n + 1) r. In this case, iterating this procedure produces, at each step, a vector space V ( n/p L, r). Taking L such that p rl p dim(v ( n/p L, r)), i.e. taking L log p n/ + B with B 1 r log p(p)/ 1 r 1 r log p, we get an upper bound of order p r+1 n r/. 5. Further remarks The complexity of polynomial evaluation is crucial in determining the complexity of several computational algebra methods, such as the Buchberger Moeller algorithm (Möller and Buchberger, 198; Mora, 009a), other commutative algebra methods (Mora, 009b), and the Berlekamp Massey Sakata algorithm (Sakata 1988, 009a). In turn, these algorithms are the main tools used in algebraic coding theory (and in cryptography). This justifies special interest in the finite field case. For example, the above algorithms can be adapted naturally to achieve iterative decoding of algebraic codes and algebraic geometry codes, see e.g. Sakata (009b), Guerrini and Rimoldi (009). Other versions can decode and construct more general geometric codes, see e.g. Geil (008). Acknowledgements The authors would like to thank C. Fontanari for valuable discussions. The first author would like to thank MIUR and GNSAGA of INDAM. The third author would like to thank MIUR for the program Rientro dei cervelli. Part of the work was done while the second author was Visiting Professor at the University of Trento, funded by CIRM. References Borodin, A., Munro, I., 195. The Computational Complexity of Algebraic Numeric Problems. Elsevier, New York. Carnicer, J., Gasca, M., Evaluation of multivariate polynomials and their derivatives. Math. Comp. 54 (189), de Boor, C., Ros, A., 199. Computational aspects of polynomial interpolation in several variables. Math. Comp. 58 (198), 05. Elia, M., Rosenthal, J., Schipani, D., 011. Efficient evaluations of polynomials over finite fields. In: Australian Communications Theory Workshop, Melbourne, Australia, 31 gennaio febbraio, pp Elia, M., Rosenthal, J., Schipani, D., in press. Polynomial evaluation over finite fields: new algorithms and complexity bounds. Appl. Algebra Engrg. Comm. Comput., Geil, O., 008. Evaluation codes from an affine variety code perspective. In: Advances in Algebraic Geometry Codes. In: Ser. Coding Theory Cryptol., vol. 5. World Sci. Publ., Hackensack, NJ, pp Guerrini, E., Rimoldi, A., 009. FGLM-like decoding: from Fitzpatrick s approach to recent developments. In: Sala, M., et al. (Eds.), Gröbner Bases, Coding and Cryptography. In: RISC Book Ser., Springer, pp Hansen, S.H., 001. Error-correcting codes from higher-dimensional varieties. Finite Fields Appl. (4), Little, J.B., 008. Algebraic geometry codes from higher dimensional varieties. In: Advances in Algebraic Geometry Codes. In: Ser. Coding Theory Cryptol., vol. 5. World Sci. Publ., Hackensack, NJ, pp Lodha, S.K., Goldman, R., 199. A unified approach to evaluation algorithms for multivariate polynomials. Math. Comp. (0), Möller, H.M., Buchberger, B., 198. The construction of multivariate polynomials with preassigned zeros. Lecture Notes in Comput. Sci. 144, Mora, T., 009a. The FGLM problem and Moeller s algorithm on zero-dimensional ideals. In: Sala, M., et al. (Eds.), Gröbner Bases, Coding and Cryptography. In: RISC Book Ser., Springer, pp. 45. Mora, T., 009b. Gröbner technology. In: Sala, M., et al. (Eds.), Gröbner Bases, Coding and Cryptography. In: RISC Book Ser., Springer, pp Pan, V.J., 19. On means of calculating values of polynomials. Uspehi Mat. Nauk 1 (1 (1)), (in Russian). Paterson, M., Stockmeyer, L., 193. On the number of nonscalar multiplications necessary to evaluate polynomials. SIAM J. Comput. (1), 0. Sakata, S., Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array. J. Symbolic Comput. 5 (3),
8 E. Ballico et al. / Journal of Symbolic Computation 50 (013) 55 Sakata, S., 009a. The BMS algorithm. In: Sala, M., et al. (Eds.), Gröbner Bases, Coding and Cryptography. In: RISC Book Ser., Springer, pp Sakata, S., 009b. The BMS algorithm and decoding of AG codes. In: Sala, M., et al. (Eds.), Gröbner Bases, Coding and Cryptography. In: RISC Book Ser., Springer, pp Schumaker, L.L., Volk, W., 198. Efficient evaluation of multivariate polynomials. Comput. Aided Geom. Design, Winograd, S., Arithmetic Complexity of Computations. SIAM, Pennsylvania.
On the BMS Algorithm
On the BMS Algorithm Shojiro Sakata The University of Electro-Communications Department of Information and Communication Engineering Chofu-shi, Tokyo 182-8585, JAPAN Abstract I will present a sketch of
More informationMöller s Algorithm. the algorithm developed in [14] was improved in [18] and applied in order to solve the FGLM-problem;
Möller s Algorithm Teo Mora (theomora@disi.unige.it) Duality was introduced in Commutative Algebra in 1982 by the seminal paper [14] but the relevance of this result became clear after the same duality
More informationStandard Bases for Linear Codes over Prime Fields
Standard Bases for Linear Codes over Prime Fields arxiv:1708.05490v1 cs.it] 18 Aug 2017 Jean Jacques Ferdinand RANDRIAMIARAMPANAHY 1 e-mail : randriamiferdinand@gmail.com Harinaivo ANDRIATAHINY 2 e-mail
More informationSolving systems of polynomial equations and minimization of multivariate polynomials
François Glineur, Polynomial solving & minimization - 1 - First Prev Next Last Full Screen Quit Solving systems of polynomial equations and minimization of multivariate polynomials François Glineur UCL/CORE
More informationPolynomial interpolation over finite fields and applications to list decoding of Reed-Solomon codes
Polynomial interpolation over finite fields and applications to list decoding of Reed-Solomon codes Roberta Barbi December 17, 2015 Roberta Barbi List decoding December 17, 2015 1 / 13 Codes Let F q be
More informationPrentice Hall: Algebra 2 with Trigonometry 2006 Correlated to: California Mathematics Content Standards for Algebra II (Grades 9-12)
California Mathematics Content Standards for Algebra II (Grades 9-12) This discipline complements and expands the mathematical content and concepts of algebra I and geometry. Students who master algebra
More informationWORKING WITH MULTIVARIATE POLYNOMIALS IN MAPLE
WORKING WITH MULTIVARIATE POLYNOMIALS IN MAPLE JEFFREY B. FARR AND ROMAN PEARCE Abstract. We comment on the implementation of various algorithms in multivariate polynomial theory. Specifically, we describe
More informationProjective Schemes with Degenerate General Hyperplane Section II
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 44 (2003), No. 1, 111-126. Projective Schemes with Degenerate General Hyperplane Section II E. Ballico N. Chiarli S. Greco
More informationCounting and Gröbner Bases
J. Symbolic Computation (2001) 31, 307 313 doi:10.1006/jsco.2000.1575 Available online at http://www.idealibrary.com on Counting and Gröbner Bases K. KALORKOTI School of Computer Science, University of
More informationElliptic Curve Discrete Logarithm Problem
Elliptic Curve Discrete Logarithm Problem Vanessa VITSE Université de Versailles Saint-Quentin, Laboratoire PRISM October 19, 2009 Vanessa VITSE (UVSQ) Elliptic Curve Discrete Logarithm Problem October
More informationInteger Multiplication
Integer Multiplication in almost linear time Martin Fürer CSE 588 Department of Computer Science and Engineering Pennsylvania State University 1/24/08 Karatsuba algebraic Split each of the two factors
More informationMIT Algebraic techniques and semidefinite optimization February 16, Lecture 4
MIT 6.972 Algebraic techniques and semidefinite optimization February 16, 2006 Lecture 4 Lecturer: Pablo A. Parrilo Scribe: Pablo A. Parrilo In this lecture we will review some basic elements of abstract
More informationAn Observation on the Positive Real Lemma
Journal of Mathematical Analysis and Applications 255, 48 49 (21) doi:1.16/jmaa.2.7241, available online at http://www.idealibrary.com on An Observation on the Positive Real Lemma Luciano Pandolfi Dipartimento
More informationMCS 563 Spring 2014 Analytic Symbolic Computation Friday 31 January. Quotient Rings
Quotient Rings In this note we consider again ideals, but here we do not start from polynomials, but from a finite set of points. The application in statistics and the pseudo code of the Buchberger-Möller
More informationIntroduction to Gröbner Bases for Geometric Modeling. Geometric & Solid Modeling 1989 Christoph M. Hoffmann
Introduction to Gröbner Bases for Geometric Modeling Geometric & Solid Modeling 1989 Christoph M. Hoffmann Algebraic Geometry Branch of mathematics. Express geometric facts in algebraic terms in order
More informationToric statistical models: parametric and binomial representations
AISM (2007) 59:727 740 DOI 10.1007/s10463-006-0079-z Toric statistical models: parametric and binomial representations Fabio Rapallo Received: 21 February 2005 / Revised: 1 June 2006 / Published online:
More informationDipartimento di Matematica
Dipartimento di Matematica S. RUFFA ON THE APPLICABILITY OF ALGEBRAIC STATISTICS TO REGRESSION MODELS WITH ERRORS IN VARIABLES Rapporto interno N. 8, maggio 006 Politecnico di Torino Corso Duca degli Abruzzi,
More informationMSRI-UP 2009 PROJECT TOPIC IDEAS. 1. Toric Codes. A first group of project topics deals with a class of codes known as toric codes.
MSRI-UP 2009 PROJECT TOPIC IDEAS JOHN LITTLE COLLEGE OF THE HOLY CROSS 1 Toric Codes A first group of project topics deals with a class of codes known as toric codes General Background In [6], [7], J Hansen
More informationJournal of Computational and Applied Mathematics. A bivariate preprocessing paradigm for the Buchberger Möller algorithm
Journal of Computational and Applied Mathematics 234 (2010) 3344 3355 Contents lists available at ScienceDirect Journal of Computational and Applied Mathematics journal homepage: wwwelseviercom/locate/cam
More informationGeneral error locator polynomials for binary cyclic codes with t 2 and n < 63
General error locator polynomials for binary cyclic codes with t 2 and n < 63 April 22, 2005 Teo Mora (theomora@disi.unige.it) Department of Mathematics, University of Genoa, Italy. Emmanuela Orsini (orsini@posso.dm.unipi.it)
More informationNonstationary Subdivision Schemes and Totally Positive Refinable Functions
Nonstationary Subdivision Schemes and Totally Positive Refinable Functions Laura Gori and Francesca Pitolli December, 2007 Abstract In this paper we construct a class of totally positive refinable functions,
More informationAlgebra I. Course Outline
Algebra I Course Outline I. The Language of Algebra A. Variables and Expressions B. Order of Operations C. Open Sentences D. Identity and Equality Properties E. The Distributive Property F. Commutative
More informationAlgebra 2 (2006) Correlation of the ALEKS Course Algebra 2 to the California Content Standards for Algebra 2
Algebra 2 (2006) Correlation of the ALEKS Course Algebra 2 to the California Content Standards for Algebra 2 Algebra II - This discipline complements and expands the mathematical content and concepts of
More informationNotes 10: List Decoding Reed-Solomon Codes and Concatenated codes
Introduction to Coding Theory CMU: Spring 010 Notes 10: List Decoding Reed-Solomon Codes and Concatenated codes April 010 Lecturer: Venkatesan Guruswami Scribe: Venkat Guruswami & Ali Kemal Sinop DRAFT
More informationIntro to Rings, Fields, Polynomials: Hardware Modeling by Modulo Arithmetic
Intro to Rings, Fields, Polynomials: Hardware Modeling by Modulo Arithmetic Priyank Kalla Associate Professor Electrical and Computer Engineering, University of Utah kalla@ece.utah.edu http://www.ece.utah.edu/~kalla
More informationNon-commutative reduction rings
Revista Colombiana de Matemáticas Volumen 33 (1999), páginas 27 49 Non-commutative reduction rings Klaus Madlener Birgit Reinert 1 Universität Kaiserslautern, Germany Abstract. Reduction relations are
More informationJournal of Symbolic Computation. On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field
Journal of Symbolic Computation 47 (2012) 480 491 Contents lists available at SciVerse ScienceDirect Journal of Symbolic Computation journal homepage: wwwelseviercom/locate/jsc On the Berlekamp/Massey
More informationLU Factorization. LU factorization is the most common way of solving linear systems! Ax = b LUx = b
AM 205: lecture 7 Last time: LU factorization Today s lecture: Cholesky factorization, timing, QR factorization Reminder: assignment 1 due at 5 PM on Friday September 22 LU Factorization LU factorization
More informationChange of Ordering for Regular Chains in Positive Dimension
Change of Ordering for Regular Chains in Positive Dimension X. Dahan, X. Jin, M. Moreno Maza, É. Schost University of Western Ontario, London, Ontario, Canada. École polytechnique, 91128 Palaiseau, France.
More informationVOYAGER INSIDE ALGEBRA CORRELATED TO THE NEW JERSEY STUDENT LEARNING OBJECTIVES AND CCSS.
We NJ Can STUDENT Early Learning LEARNING Curriculum OBJECTIVES PreK Grades 8 12 VOYAGER INSIDE ALGEBRA CORRELATED TO THE NEW JERSEY STUDENT LEARNING OBJECTIVES AND CCSS www.voyagersopris.com/insidealgebra
More informationSome congruences for Andrews Paule s broken 2-diamond partitions
Discrete Mathematics 308 (2008) 5735 5741 www.elsevier.com/locate/disc Some congruences for Andrews Paule s broken 2-diamond partitions Song Heng Chan Division of Mathematical Sciences, School of Physical
More informationAn Interpolation Algorithm for List Decoding of Reed-Solomon Codes
An Interpolation Algorithm for List Decoding of Reed-Solomon Codes Kwankyu Lee Department of Mathematics San Diego State University San Diego, USA Email: kwankyu@sogangackr Michael E O Sullivan Department
More informationOn The Belonging Of A Perturbed Vector To A Subspace From A Numerical View Point
Applied Mathematics E-Notes, 7(007), 65-70 c ISSN 1607-510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ On The Belonging Of A Perturbed Vector To A Subspace From A Numerical View
More informationRoots and Coefficients Polynomials Preliminary Maths Extension 1
Preliminary Maths Extension Question If, and are the roots of x 5x x 0, find the following. (d) (e) Question If p, q and r are the roots of x x x 4 0, evaluate the following. pq r pq qr rp p q q r r p
More informationWest Windsor-Plainsboro Regional School District Math A&E Grade 7
West Windsor-Plainsboro Regional School District Math A&E Grade 7 Page 1 of 24 Unit 1: Introduction to Algebra Content Area: Mathematics Course & Grade Level: A&E Mathematics, Grade 7 Summary and Rationale
More informationOn some properties of elementary derivations in dimension six
Journal of Pure and Applied Algebra 56 (200) 69 79 www.elsevier.com/locate/jpaa On some properties of elementary derivations in dimension six Joseph Khoury Department of Mathematics, University of Ottawa,
More informationOnline Courses for High School Students
Online Courses for High School Students 1-888-972-6237 Algebra I Course Description: Students explore the tools of algebra and learn to identify the structure and properties of the real number system;
More informationDimension Quasi-polynomials of Inversive Difference Field Extensions with Weighted Translations
Dimension Quasi-polynomials of Inversive Difference Field Extensions with Weighted Translations Alexander Levin The Catholic University of America Washington, D. C. 20064 Spring Eastern Sectional AMS Meeting
More informationDeterministic distinct-degree factorisation of polynomials over finite fields*
Article Submitted to Journal of Symbolic Computation Deterministic distinct-degree factorisation of polynomials over finite fields* Shuhong Gao 1, Erich Kaltofen 2 and Alan G.B. Lauder 3 1 Department of
More informationInteresting Examples on Maximal Irreducible Goppa Codes
Interesting Examples on Maximal Irreducible Goppa Codes Marta Giorgetti Dipartimento di Fisica e Matematica, Universita dell Insubria Abstract. In this paper a full categorization of irreducible classical
More informationNew Constructions for De Bruijn Tori
New Constructions for De Bruijn Tori Glenn Hurlbert Garth Isaak Dedicated to the memory of Tony Brewster Abstract A De Bruijn torus is a periodic d dimensional k ary array such that each n 1 n d k ary
More informationMATH Spring 2010 Topics per Section
MATH 101 - Spring 2010 Topics per Section Chapter 1 : These are the topics in ALEKS covered by each Section of the book. Section 1.1 : Section 1.2 : Ordering integers Plotting integers on a number line
More informationA NOTE ON AN ADDITIVE PROPERTY OF PRIMES
A NOTE ON AN ADDITIVE PROPERTY OF PRIMES LUCA GOLDONI Abstract. An elementary construction is given of an infinite sequence of natural numbers, having at least two different decompositions as sum of primes
More informationLecture 9: List decoding Reed-Solomon and Folded Reed-Solomon codes
Lecture 9: List decoding Reed-Solomon and Folded Reed-Solomon codes Error-Correcting Codes (Spring 2016) Rutgers University Swastik Kopparty Scribes: John Kim and Pat Devlin 1 List decoding review Definition
More informationALGEBRA II CURRICULUM MAP
2017-2018 MATHEMATICS ALGEBRA II CURRICULUM MAP Department of Curriculum and Instruction RCCSD Common Core Major Emphasis Clusters The Real Number System Extend the properties of exponents to rational
More informationMATH 0409: Foundations of Mathematics COURSE OUTLINE
MATH 0409: Foundations of Mathematics COURSE OUTLINE Spring 2016 CRN91085 MW 5:30-7:30pm AM209 Professor Sherri Escobar sherri.escobar@hccs.edu 281-620-1115 Catalog Description: Foundations of Mathematics.
More informationOeding (Auburn) tensors of rank 5 December 15, / 24
Oeding (Auburn) 2 2 2 2 2 tensors of rank 5 December 15, 2015 1 / 24 Recall Peter Burgisser s overview lecture (Jan Draisma s SIAM News article). Big Goal: Bound the computational complexity of det n,
More informationSPECTRA - a Maple library for solving linear matrix inequalities in exact arithmetic
SPECTRA - a Maple library for solving linear matrix inequalities in exact arithmetic Didier Henrion Simone Naldi Mohab Safey El Din Version 1.0 of November 5, 2016 Abstract This document briefly describes
More informationOn the Weight Distribution of N-th Root Codes
Fabrizio Caruso Marta Giorgetti June 10, 2009 The Recurrence Proof by Generating Functions A Computer-Generated Proof Computing Some Steps of the Recurrence A Computer-Provable Identity Proving the Guessed
More informationA Polynomial Description of the Rijndael Advanced Encryption Standard
A Polynomial Description of the Rijndael Advanced Encryption Standard arxiv:cs/0205002v1 [cs.cr] 2 May 2002 Joachim Rosenthal Department of Mathematics University of Notre Dame Notre Dame, Indiana 46556,
More informationSOLVING THE PELL EQUATION VIA RÉDEI RATIONAL FUNCTIONS
STEFANO BARBERO, UMBERTO CERRUTI, AND NADIR MURRU Abstract. In this paper, we define a new product over R, which allows us to obtain a group isomorphic to R with the usual product. This operation unexpectedly
More informationDecoding Reed-Muller codes over product sets
Rutgers University May 30, 2016 Overview Error-correcting codes 1 Error-correcting codes Motivation 2 Reed-Solomon codes Reed-Muller codes 3 Error-correcting codes Motivation Goal: Send a message Don t
More informationEquivalence constants for certain matrix norms II
Linear Algebra and its Applications 420 (2007) 388 399 www.elsevier.com/locate/laa Equivalence constants for certain matrix norms II Bao Qi Feng a,, Andrew Tonge b a Department of Mathematical Sciences,
More informationAlgebra 2 Secondary Mathematics Instructional Guide
Algebra 2 Secondary Mathematics Instructional Guide 2009-2010 ALGEBRA 2AB (Grade 9, 10 or 11) Prerequisite: Algebra 1AB or Geometry AB 310303 Algebra 2A 310304 Algebra 2B COURSE DESCRIPTION Los Angeles
More informationGeneral error locator polynomials for nth-root codes
General error locator polynomials for nth-root codes Marta Giorgetti 1 and Massimiliano Sala 2 1 Department of Mathematics, University of Milano, Italy 2 Boole Centre for Research in Informatics, UCC Cork,
More informationLecture Introduction. 2 Formal Definition. CS CTT Current Topics in Theoretical CS Oct 30, 2012
CS 59000 CTT Current Topics in Theoretical CS Oct 30, 0 Lecturer: Elena Grigorescu Lecture 9 Scribe: Vivek Patel Introduction In this lecture we study locally decodable codes. Locally decodable codes are
More informationON THE DIVISOR FUNCTION IN SHORT INTERVALS
ON THE DIVISOR FUNCTION IN SHORT INTERVALS Danilo Bazzanella Dipartimento di Matematica, Politecnico di Torino, Italy danilo.bazzanella@polito.it Autor s version Published in Arch. Math. (Basel) 97 (2011),
More informationComputer Vision, Convolutions, Complexity and Algebraic Geometry
Computer Vision, Convolutions, Complexity and Algebraic Geometry D. V. Chudnovsky, G.V. Chudnovsky IMAS Polytechnic Institute of NYU 6 MetroTech Center Brooklyn, NY 11201 December 6, 2012 Fast Multiplication:
More informationDipartimento di Matematica
Dipartimento di Matematica G. PISTONE, M. P. ROGANTIN INDICATOR FUNCTION AND COMPLEX CODING FOR MIXED FRACTIONAL FACTORIAL DESIGNS (REVISED 2006) Rapporto interno N. 17, luglio 2006 Politecnico di Torino
More informationOn the minimal free resolution of a monomial ideal.
On the minimal free resolution of a monomial ideal. Caitlin M c Auley August 2012 Abstract Given a monomial ideal I in the polynomial ring S = k[x 1,..., x n ] over a field k, we construct a minimal free
More informationCOMPUTER ARITHMETIC. 13/05/2010 cryptography - math background pp. 1 / 162
COMPUTER ARITHMETIC 13/05/2010 cryptography - math background pp. 1 / 162 RECALL OF COMPUTER ARITHMETIC computers implement some types of arithmetic for instance, addition, subtratction, multiplication
More informationBounding the number of affine roots
with applications in reliable and secure communication Inaugural Lecture, Aalborg University, August 11110, 11111100000 with applications in reliable and secure communication Polynomials: F (X ) = 2X 2
More informationModern Computer Algebra
Modern Computer Algebra JOACHIM VON ZUR GATHEN and JURGEN GERHARD Universitat Paderborn CAMBRIDGE UNIVERSITY PRESS Contents Introduction 1 1 Cyclohexane, cryptography, codes, and computer algebra 9 1.1
More informationGröbner Bases in Public-Key Cryptography
Gröbner Bases in Public-Key Cryptography Ludovic Perret SPIRAL/SALSA LIP6, Université Paris 6 INRIA ludovic.perret@lip6.fr ECRYPT PhD SUMMER SCHOOL Emerging Topics in Cryptographic Design and Cryptanalysis
More informationThe p-adic Numbers. Akhil Mathew. 4 May Math 155, Professor Alan Candiotti
The p-adic Numbers Akhil Mathew Math 155, Professor Alan Candiotti 4 May 2009 Akhil Mathew (Math 155, Professor Alan Candiotti) The p-adic Numbers 4 May 2009 1 / 17 The standard absolute value on R: A
More informationMath 115 Spring 11 Written Homework 10 Solutions
Math 5 Spring Written Homework 0 Solutions. For following its, state what indeterminate form the its are in and evaluate the its. (a) 3x 4x 4 x x 8 Solution: This is in indeterminate form 0. Algebraically,
More informationMathematics. Algebra I (PreAP, Pt. 1, Pt. 2) Curriculum Guide. Revised 2016
Mathematics Algebra I (PreAP, Pt. 1, Pt. ) Curriculum Guide Revised 016 Intentionally Left Blank Introduction The Mathematics Curriculum Guide serves as a guide for teachers when planning instruction and
More informationGRÖBNER BASES AND POLYNOMIAL EQUATIONS. 1. Introduction and preliminaries on Gróbner bases
GRÖBNER BASES AND POLYNOMIAL EQUATIONS J. K. VERMA 1. Introduction and preliminaries on Gróbner bases Let S = k[x 1, x 2,..., x n ] denote a polynomial ring over a field k where x 1, x 2,..., x n are indeterminates.
More informationCHAPMAN & HALL/CRC CRYPTOGRAPHY AND NETWORK SECURITY ALGORITHMIC CR YPTAN ALY51S. Ant nine J aux
CHAPMAN & HALL/CRC CRYPTOGRAPHY AND NETWORK SECURITY ALGORITHMIC CR YPTAN ALY51S Ant nine J aux (g) CRC Press Taylor 8* Francis Croup Boca Raton London New York CRC Press is an imprint of the Taylor &
More informationMATH 423 Linear Algebra II Lecture 3: Subspaces of vector spaces. Review of complex numbers. Vector space over a field.
MATH 423 Linear Algebra II Lecture 3: Subspaces of vector spaces. Review of complex numbers. Vector space over a field. Vector space A vector space is a set V equipped with two operations, addition V V
More information(x 1 +x 2 )(x 1 x 2 )+(x 2 +x 3 )(x 2 x 3 )+(x 3 +x 1 )(x 3 x 1 ).
CMPSCI611: Verifying Polynomial Identities Lecture 13 Here is a problem that has a polynomial-time randomized solution, but so far no poly-time deterministic solution. Let F be any field and let Q(x 1,...,
More informationLecture 6: Finite Fields
CCS Discrete Math I Professor: Padraic Bartlett Lecture 6: Finite Fields Week 6 UCSB 2014 It ain t what they call you, it s what you answer to. W. C. Fields 1 Fields In the next two weeks, we re going
More informationAlgebra 1 Correlation of the ALEKS course Algebra 1 to the Washington Algebra 1 Standards
Algebra 1 Correlation of the ALEKS course Algebra 1 to the Washington Algebra 1 Standards A1.1: Core Content: Solving Problems A1.1.A: Select and justify functions and equations to model and solve problems.
More informationRational Normal Curves as Set-Theoretic Complete Intersections of Quadrics
Rational Normal Curves as Set-Theoretic Complete Intersections of Quadrics Maria-Laura Torrente Dipartimento di Matematica, Università di Genova, Via Dodecaneso 35, I-16146 Genova, Italy torrente@dimaunigeit
More informationOn Multivariate Newton Interpolation at Discrete Leja Points
On Multivariate Newton Interpolation at Discrete Leja Points L. Bos 1, S. De Marchi 2, A. Sommariva 2, M. Vianello 2 September 25, 2011 Abstract The basic LU factorization with row pivoting, applied to
More informationOverview of Computer Algebra
Overview of Computer Algebra http://cocoa.dima.unige.it/ J. Abbott Universität Kassel J. Abbott Computer Algebra Basics Manchester, July 2018 1 / 12 Intro Characteristics of Computer Algebra or Symbolic
More information1.3 Algebraic Expressions. Copyright Cengage Learning. All rights reserved.
1.3 Algebraic Expressions Copyright Cengage Learning. All rights reserved. Objectives Adding and Subtracting Polynomials Multiplying Algebraic Expressions Special Product Formulas Factoring Common Factors
More informationECEN 5682 Theory and Practice of Error Control Codes
ECEN 5682 Theory and Practice of Error Control Codes Introduction to Algebra University of Colorado Spring 2007 Motivation and For convolutional codes it was convenient to express the datawords and the
More informationLecture 6: Introducing Complexity
COMP26120: Algorithms and Imperative Programming Lecture 6: Introducing Complexity Ian Pratt-Hartmann Room KB2.38: email: ipratt@cs.man.ac.uk 2015 16 You need this book: Make sure you use the up-to-date
More informationAlgebra for error control codes
Algebra for error control codes EE 387, Notes 5, Handout #7 EE 387 concentrates on block codes that are linear: Codewords components are linear combinations of message symbols. g 11 g 12 g 1n g 21 g 22
More informationHarbor Creek School District. Algebra II Advanced. Concepts Timeframe Skills Assessment Standards Linear Equations Inequalities
Algebra II Advanced and Graphing and Solving Linear Linear Absolute Value Relation vs. Standard Forms of Linear Slope Parallel & Perpendicular Lines Scatterplot & Linear Regression Graphing linear Absolute
More informationCPSC 536N: Randomized Algorithms Term 2. Lecture 9
CPSC 536N: Randomized Algorithms 2011-12 Term 2 Prof. Nick Harvey Lecture 9 University of British Columbia 1 Polynomial Identity Testing In the first lecture we discussed the problem of testing equality
More informationComputing Minimal Polynomial of Matrices over Algebraic Extension Fields
Bull. Math. Soc. Sci. Math. Roumanie Tome 56(104) No. 2, 2013, 217 228 Computing Minimal Polynomial of Matrices over Algebraic Extension Fields by Amir Hashemi and Benyamin M.-Alizadeh Abstract In this
More informationComputer Science & Engineering 423/823 Design and Analysis of Algorithms
Computer Science & Engineering 423/823 Design and Analysis of Algorithms Lecture 03 Dynamic Programming (Chapter 15) Stephen Scott and Vinodchandran N. Variyam sscott@cse.unl.edu 1/44 Introduction Dynamic
More informationClassifying partial Latin rectangles
Raúl Falcón 1, Rebecca Stones 2 rafalgan@us.es 1 Department of Applied Mathematics I. University of Seville. 2 College of Computer and Control Engineering. Nankai University. Bergen. September 4, 2015.
More informationJournal of Combinatorial Theory, Series A
Journal of Combinatorial Theory, Series A 6 2009 32 42 Contents lists available at ScienceDirect Journal of Combinatorial Theory, Series A wwwelseviercom/locate/jcta Equipartitions of a mass in boxes Siniša
More informationData Compression Techniques
Data Compression Techniques Part 1: Entropy Coding Lecture 4: Asymmetric Numeral Systems Juha Kärkkäinen 08.11.2017 1 / 19 Asymmetric Numeral Systems Asymmetric numeral systems (ANS) is a recent entropy
More informationA Construction of Small (q 1)-Regular Graphs of Girth 8
A Construction of Small (q 1)-Regular Graphs of Girth 8 M. Abreu Dipartimento di Matematica, Informatica ed Economia Università degli Studi della Basilicata I-85100 Potenza, Italy marien.abreu@unibas.it
More informationChapter 5 Divide and Conquer
CMPT 705: Design and Analysis of Algorithms Spring 008 Chapter 5 Divide and Conquer Lecturer: Binay Bhattacharya Scribe: Chris Nell 5.1 Introduction Given a problem P with input size n, P (n), we define
More informationComputing with polynomials: Hensel constructions
Course Polynomials: Their Power and How to Use Them, JASS 07 Computing with polynomials: Hensel constructions Lukas Bulwahn March 28, 2007 Abstract To solve GCD calculations and factorization of polynomials
More informationcorrelated to the Washington D.C. Public Schools Learning Standards Algebra I
correlated to the Washington D.C. Public Schools Learning Standards Algebra I McDougal Littell Algebra 1 2007 correlated to the Washington DC Public Schools Learning Standards Algebra I NUMBER SENSE AND
More informationIDEAL INTERPOLATION: MOURRAIN S CONDITION VS D-INVARIANCE
**************************************** BANACH CENTER PUBLICATIONS, VOLUME ** INSTITUTE OF MATHEMATICS POLISH ACADEMY OF SCIENCES WARSZAWA 200* IDEAL INTERPOLATION: MOURRAIN S CONDITION VS D-INVARIANCE
More informationMCS 563 Spring 2014 Analytic Symbolic Computation Monday 27 January. Gröbner bases
Gröbner bases In this lecture we introduce Buchberger s algorithm to compute a Gröbner basis for an ideal, following [2]. We sketch an application in filter design. Showing the termination of Buchberger
More informationFormulas for cube roots in F 3 m
Discrete Applied Mathematics 155 (2007) 260 270 www.elsevier.com/locate/dam Formulas for cube roots in F 3 m Omran Ahmadi a, Darrel Hankerson b, Alfred Menezes a a Department of Combinatorics and Optimization,
More informationFast Polynomial Reduction. Nikolay Vassiliev Steklov Inst. оf Math. St.Petersburg
Fast Polynomial Reduction Nikolay Vassiliev Steklov Inst. оf Math. St.Petersburg CADE2009, Papmlona, 2009 30 October Outline of the talk Gröbner bases and normal forms in commutative and differential algebra
More informationUnit 3 Vocabulary. An algebraic expression that can contains. variables, numbers and operators (like +, An equation is a math sentence stating
Hart Interactive Math Algebra 1 MODULE 2 An algebraic expression that can contains 1 Algebraic Expression variables, numbers and operators (like +,, x and ). 1 Equation An equation is a math sentence stating
More informationCourse: Algebra MP: Reason abstractively and quantitatively MP: Model with mathematics MP: Look for and make use of structure
Algebra Cluster: Interpret the structure of expressions. A.SSE.1: Interpret expressions that represent a quantity in terms of its context (Modeling standard). a. Interpret parts of an expression, such
More informationAn O(n 3 log log n/ log n) Time Algorithm for the All-Pairs Shortest Path Problem
An O(n 3 log log n/ log n) Time Algorithm for the All-Pairs Shortest Path Problem Tadao Takaoka Department of Computer Science University of Canterbury Christchurch, New Zealand October 27, 2004 1 Introduction
More informationCLEP EXAMINATION: Precalculus
CLEP EXAMINATION: Precalculus DESCRIPTION OF THE EXAMINATION: The Precalculus examination assesses student mastery of skills and concepts required for success in a first-semester calculus course. A large
More informationGrades K 6. Tap into on-the-go learning! hmhco.com. Made in the United States Text printed on 100% recycled paper hmhco.
Tap into on-the-go learning! C A L I F O R N I A Scop e a n d Se q u e n c e Grades K 6 Made in the United States Text printed on 100% recycled paper 1560277 hmhco.com K Made in the United States Text
More information