1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598
|
/**************************************************************************\
MODULE: ZZX
SUMMARY:
The class ZZX implements polynomials in ZZ[X], i.e., univariate
polynomials with integer coefficients.
Polynomial multiplication is implemented using one of 4 different
algorithms:
1) classical
2) Karatsuba
3) Schoenhage & Strassen --- performs an FFT by working
modulo a "Fermat number" of appropriate size...
good for polynomials with huge coefficients
and moderate degree
4) CRT/FFT --- performs an FFT by working modulo several
small primes...good for polynomials with moderate coefficients
and huge degree.
The choice of algorithm is somewhat heuristic, and may not always be
perfect.
Many thanks to Juergen Gerhard <jngerhar@plato.uni-paderborn.de> for
pointing out the deficiency in the NTL-1.0 ZZX arithmetic, and for
contributing the Schoenhage/Strassen code.
Extensive use is made of modular algorithms to enhance performance
(e.g., the GCD algorithm and amny others).
\**************************************************************************/
#include <NTL/vec_ZZ.h>
#include "zz_pX.h"
#include <NTL/ZZ_pX.h>
class ZZX {
public:
ZZX(); // initial value 0
ZZX(const ZZX& a); // copy
explicit ZZX(const ZZ& a); // promotion
explicit ZZX(long a); // promotion
~ZZX();
ZZX(INIT_MONO_TYPE, long i, const ZZ& c);
ZZX(INIT_MONO_TYPE, long i, long c);
// initial value c*X^i, invoke as ZZX(INIT_MONO, i, c)
ZZX(INIT_MONO_TYPE, long i);
// initial value X^i, invoke as ZZX(INIT_MONO, i)
ZZX& operator=(const ZZX& a); // assignment
ZZX& operator=(const ZZ& a);
ZZX& operator=(long a);
typedef ZZ coeff_type;
// ...
};
/**************************************************************************\
Accessing coefficients
The degree of a polynomial f is obtained as deg(f),
where the zero polynomial, by definition, has degree -1.
A polynomial f is represented as a coefficient vector.
Coefficients may be accesses in one of two ways.
The safe, high-level method is to call the function
coeff(f, i) to get the coefficient of X^i in the polynomial f,
and to call the function SetCoeff(f, i, a) to set the coefficient
of X^i in f to the scalar a.
One can also access the coefficients more directly via a lower level
interface. The coefficient of X^i in f may be accessed using
subscript notation f[i]. In addition, one may write f.SetLength(n)
to set the length of the underlying coefficient vector to n,
and f.SetMaxLength(n) to allocate space for n coefficients,
without changing the coefficient vector itself.
After setting coefficients using this low-level interface,
one must ensure that leading zeros in the coefficient vector
are stripped afterwards by calling the function f.normalize().
NOTE: the coefficient vector of f may also be accessed directly
as f.rep; however, this is not recommended. Also, for a properly
normalized polynomial f, we have f.rep.length() == deg(f)+1,
and deg(f) >= 0 => f.rep[deg(f)] != 0.
\**************************************************************************/
long deg(const ZZX& a); // return deg(a); deg(0) == -1.
const ZZ& coeff(const ZZX& a, long i);
// returns the coefficient of X^i, or zero if i not in range
const ZZ& LeadCoeff(const ZZX& a);
// returns leading term of a, or zero if a == 0
const ZZ& ConstTerm(const ZZX& a);
// returns constant term of a, or zero if a == 0
void SetCoeff(ZZX& x, long i, const ZZ& a);
void SetCoeff(ZZX& x, long i, long a);
// makes coefficient of X^i equal to a; error is raised if i < 0
void SetCoeff(ZZX& x, long i);
// makes coefficient of X^i equal to 1; error is raised if i < 0
void SetX(ZZX& x); // x is set to the monomial X
long IsX(const ZZX& a); // test if x = X
ZZ& ZZX::operator[](long i);
const ZZ& ZZX::operator[](long i) const;
// indexing operators: f[i] is the coefficient of X^i ---
// i should satsify i >= 0 and i <= deg(f).
// No range checking (unless NTL_RANGE_CHECK is defined).
void ZZX::SetLength(long n);
// f.SetLength(n) sets the length of the inderlying coefficient
// vector to n --- after this call, indexing f[i] for i = 0..n-1
// is valid.
void ZZX::normalize();
// f.normalize() strips leading zeros from coefficient vector of f
void ZZX::SetMaxLength(long n);
// f.SetMaxLength(n) pre-allocate spaces for n coefficients. The
// polynomial that f represents is unchanged.
/**************************************************************************\
Comparison
\**************************************************************************/
long operator==(const ZZX& a, const ZZX& b);
long operator!=(const ZZX& a, const ZZX& b);
long IsZero(const ZZX& a); // test for 0
long IsOne(const ZZX& a); // test for 1
// PROMOTIONS: operators ==, != promote {long, ZZ} to ZZX on (a, b).
/**************************************************************************\
Addition
\**************************************************************************/
// operator notation:
ZZX operator+(const ZZX& a, const ZZX& b);
ZZX operator-(const ZZX& a, const ZZX& b);
ZZX operator-(const ZZX& a); // unary -
ZZX& operator+=(ZZX& x, const ZZX& a);
ZZX& operator-=(ZZX& x, const ZZX& a);
ZZX& operator++(ZZX& x); // prefix
void operator++(ZZX& x, int); // postfix
ZZX& operator--(ZZX& x); // prefix
void operator--(ZZX& x, int); // postfix
// procedural versions:
void add(ZZX& x, const ZZX& a, const ZZX& b); // x = a + b
void sub(ZZX& x, const ZZX& a, const ZZX& b); // x = a - b
void negate(ZZX& x, const ZZX& a); // x = -a
// PROMOTIONS: binary +, - and procedures add, sub promote {long, ZZ}
// to ZZX on (a, b).
/**************************************************************************\
Multiplication
\**************************************************************************/
// operator notation:
ZZX operator*(const ZZX& a, const ZZX& b);
ZZX& operator*=(ZZX& x, const ZZX& a);
// procedural versions:
void mul(ZZX& x, const ZZX& a, const ZZX& b); // x = a * b
void sqr(ZZX& x, const ZZX& a); // x = a^2
ZZX sqr(const ZZX& a);
// PROMOTIONS: operator * and procedure mul promote {long, ZZ} to ZZX
// on (a, b).
/**************************************************************************\
Shift Operations
LeftShift by n means multiplication by X^n
RightShift by n means division by X^n
A negative shift amount reverses the direction of the shift.
\**************************************************************************/
// operator notation:
ZZX operator<<(const ZZX& a, long n);
ZZX operator>>(const ZZX& a, long n);
ZZX& operator<<=(ZZX& x, long n);
ZZX& operator>>=(ZZX& x, long n);
// procedural versions:
void LeftShift(ZZX& x, const ZZX& a, long n);
ZZX LeftShift(const ZZX& a, long n);
void RightShift(ZZX& x, const ZZX& a, long n);
ZZX RightShift(const ZZX& a, long n);
/**************************************************************************\
Division
\**************************************************************************/
// Given polynomials a, b in ZZ[X], there exist polynomials
// q, r in QQ[X] such that a = b*q + r, deg(r) < deg(b).
// These routines return q and/or r if q and/or r lie(s) in ZZ[X],
// and otherwise raise an error.
// Note that if the leading coefficient of b is 1 or -1,
// then q and r always lie in ZZ[X], and no error can occur.
// For example, you can write f/2 for a ZZX f. If all coefficients
// of f are even, the result is f with a factor of two removed;
// otherwise, an error is raised. More generally, f/g will be
// evaluate q in ZZ[X] such that f = q*g if such a q exists,
// and will otherwise raise an error.
// See also below the routines for pseudo-division and division
// predicates for routines that are perhaps more useful in
// some situations.
// operator notation:
ZZX operator/(const ZZX& a, const ZZX& b);
ZZX operator/(const ZZX& a, const ZZ& b);
ZZX operator/(const ZZX& a, long b);
ZZX operator%(const ZZX& a, const ZZX& b);
ZZX& operator/=(ZZX& x, const ZZX& b);
ZZX& operator/=(ZZX& x, const ZZ& b);
ZZX& operator/=(ZZX& x, long b);
ZZX& operator%=(ZZX& x, const ZZX& b);
// procedural versions:
void DivRem(ZZX& q, ZZX& r, const ZZX& a, const ZZX& b);
// computes q, r such that a = b q + r and deg(r) < deg(b).
// requires LeadCoeff(b) is a unit (+1, -1); otherwise,
// an error is raised.
void div(ZZX& q, const ZZX& a, const ZZX& b);
void div(ZZX& q, const ZZX& a, const ZZ& b);
void div(ZZX& q, const ZZX& a, long b);
// same as DivRem, but only computes q
void rem(ZZX& r, const ZZX& a, const ZZX& b);
// same as DivRem, but only computes r
// divide predicates:
long divide(ZZX& q, const ZZX& a, const ZZX& b);
long divide(ZZX& q, const ZZX& a, const ZZ& b);
long divide(ZZX& q, const ZZX& a, long b);
// if b | a, sets q = a/b and returns 1; otherwise returns 0
long divide(const ZZX& a, const ZZX& b);
long divide(const ZZX& a, const ZZ& b);
long divide(const ZZX& a, long b);
// if b | a, returns 1; otherwise returns 0
// These algorithms employ a modular approach, performing the division
// modulo small primes (reconstructing q via the CRT). It is
// usually much faster than the general division routines above
// (especially when b does not divide a).
void content(ZZ& d, const ZZX& f);
ZZ content(const ZZX& f);
// d = content of f, sign(d) == sign(LeadCoeff(f)); content(0) == 0
void PrimitivePart(ZZX& pp, const ZZX& f);
ZZX PrimitivePart(const ZZX& f);
// pp = primitive part of f, LeadCoeff(pp) >= 0; PrimitivePart(0) == 0
// pseudo-division:
void PseudoDivRem(ZZX& q, ZZX& r, const ZZX& a, const ZZX& b);
// performs pseudo-division: computes q and r with deg(r) < deg(b),
// and LeadCoeff(b)^(deg(a)-deg(b)+1) a = b q + r. Only the classical
// algorithm is used.
void PseudoDiv(ZZX& q, const ZZX& a, const ZZX& b);
ZZX PseudoDiv(const ZZX& a, const ZZX& b);
// same as PseudoDivRem, but only computes q
void PseudoRem(ZZX& r, const ZZX& a, const ZZX& b);
ZZX PseudoRem(const ZZX& a, const ZZX& b);
// same as PseudoDivRem, but only computes r
/**************************************************************************\
GCD's
\**************************************************************************/
void GCD(ZZX& d, const ZZX& a, const ZZX& b);
ZZX GCD(const ZZX& a, const ZZX& b);
// d = gcd(a, b), LeadCoeff(d) >= 0. Uses a modular algorithm.
void XGCD(ZZ& r, ZZX& s, ZZX& t, const ZZX& a, const ZZX& b,
long deterministic=0);
// r = resultant of a and b; if r != 0, then computes s and t such
// that: a*s + b*t = r; otherwise s and t not affected. if
// !deterministic, then resultant computation may use a randomized
// strategy that errs with probability no more than 2^{-80}.
/**************************************************************************\
Input/Output
I/O format:
[a_0 a_1 ... a_n],
represents the polynomial a_0 + a_1*X + ... + a_n*X^n.
\**************************************************************************/
istream& operator>>(istream& s, ZZX& x);
ostream& operator<<(ostream& s, const ZZX& a);
/**************************************************************************\
Some utility routines
\**************************************************************************/
void diff(ZZX& x, const ZZX& a); // x = derivative of a
ZZX diff(const ZZX& a);
long MaxBits(const ZZX& f);
// returns max NumBits of coefficients of f
void reverse(ZZX& x, const ZZX& a, long hi);
ZZX reverse(const ZZX& a, long hi);
void reverse(ZZX& x, const ZZX& a);
ZZX reverse(const ZZX& a);
// x = reverse of a[0]..a[hi] (hi >= -1);
// hi defaults to deg(a) in second version
void VectorCopy(vec_ZZ& x, const ZZX& a, long n);
vec_ZZ VectorCopy(const ZZX& a, long n);
// x = copy of coefficient vector of a of length exactly n.
// input is truncated or padded with zeroes as appropriate.
/**************************************************************************\
Arithmetic mod X^n
All routines require n >= 0, otherwise an error is raised.
\**************************************************************************/
void trunc(ZZX& x, const ZZX& a, long m); // x = a % X^m
ZZX trunc(const ZZX& a, long m);
void MulTrunc(ZZX& x, const ZZX& a, const ZZX& b, long n);
ZZX MulTrunc(const ZZX& a, const ZZX& b, long n);
// x = a * b % X^n
void SqrTrunc(ZZX& x, const ZZX& a, long n);
ZZX SqrTrunc(const ZZX& a, long n);
// x = a^2 % X^n
void InvTrunc(ZZX& x, const ZZX& a, long n);
ZZX InvTrunc(const ZZX& a, long n);
// computes x = a^{-1} % X^m. Must have ConstTerm(a) invertible.
/**************************************************************************\
Modular Arithmetic
The modulus f must be monic with deg(f) > 0,
and other arguments must have smaller degree.
\**************************************************************************/
void MulMod(ZZX& x, const ZZX& a, const ZZX& b, const ZZX& f);
ZZX MulMod(const ZZX& a, const ZZX& b, const ZZX& f);
// x = a * b mod f
void SqrMod(ZZX& x, const ZZX& a, const ZZX& f);
ZZX SqrMod(const ZZX& a, const ZZX& f);
// x = a^2 mod f
void MulByXMod(ZZX& x, const ZZX& a, const ZZX& f);
ZZX MulByXMod(const ZZX& a, const ZZX& f);
// x = a*X mod f
/**************************************************************************\
traces, norms, resultants, discriminants,
minimal and characteristic polynomials
\**************************************************************************/
void TraceMod(ZZ& res, const ZZX& a, const ZZX& f);
ZZ TraceMod(const ZZX& a, const ZZX& f);
// res = trace of (a mod f). f must be monic, 0 < deg(f), deg(a) <
// deg(f)
void TraceVec(vec_ZZ& S, const ZZX& f);
vec_ZZ TraceVec(const ZZX& f);
// S[i] = Trace(X^i mod f), for i = 0..deg(f)-1.
// f must be a monic polynomial.
// The following routines use a modular approach.
void resultant(ZZ& res, const ZZX& a, const ZZX& b, long deterministic=0);
ZZ resultant(const ZZX& a, const ZZX& b, long deterministic=0);
// res = resultant of a and b. If !deterministic, then it may use a
// randomized strategy that errs with probability no more than
// 2^{-80}.
void NormMod(ZZ& res, const ZZX& a, const ZZX& f, long deterministic=0);
ZZ NormMod(const ZZX& a, const ZZX& f, long deterministic=0);
// res = norm of (a mod f). f must be monic, 0 < deg(f), deg(a) <
// deg(f). If !deterministic, then it may use a randomized strategy
// that errs with probability no more than 2^{-80}.
void discriminant(ZZ& d, const ZZX& a, long deterministic=0);
ZZ discriminant(const ZZX& a, long deterministic=0);
// d = discriminant of a = (-1)^{m(m-1)/2} resultant(a, a')/lc(a),
// where m = deg(a). If !deterministic, then it may use a randomized
// strategy that errs with probability no more than 2^{-80}.
void CharPolyMod(ZZX& g, const ZZX& a, const ZZX& f, long deterministic=0);
ZZX CharPolyMod(const ZZX& a, const ZZX& f, long deterministic=0);
// g = char poly of (a mod f). f must be monic. If !deterministic,
// then it may use a randomized strategy that errs with probability no
// more than 2^{-80}.
void MinPolyMod(ZZX& g, const ZZX& a, const ZZX& f);
ZZX MinPolyMod(const ZZX& a, const ZZX& f);
// g = min poly of (a mod f). f must be monic, 0 < deg(f), deg(a) <
// deg(f). May use a probabilistic strategy that errs with
// probability no more than 2^{-80}.
/**************************************************************************\
Incremental Chinese Remaindering
\**************************************************************************/
long CRT(ZZX& a, ZZ& prod, const zz_pX& A);
long CRT(ZZX& a, ZZ& prod, const ZZ_pX& A);
// Incremental Chinese Remaindering: If p is the current zz_p/ZZ_p modulus with
// (p, prod) = 1; Computes a' such that a' = a mod prod and a' = A mod p,
// with coefficients in the interval (-p*prod/2, p*prod/2];
// Sets a := a', prod := p*prod, and returns 1 if a's value changed.
/**************************************************************************\
vectors of ZZX's
\**************************************************************************/
typedef Vec<ZZX> vec_ZZX; // backward compatibility
/**************************************************************************\
Miscellany
\**************************************************************************/
void clear(ZZX& x); // x = 0
void set(ZZX& x); // x = 1
void ZZX::kill();
// f.kill() sets f to 0 and frees all memory held by f. Equivalent to
// f.rep.kill().
ZZX::ZZX(INIT_SIZE_TYPE, long n);
// ZZX(INIT_SIZE, n) initializes to zero, but space is pre-allocated
// for n coefficients
static const ZZX& zero();
// ZZX::zero() is a read-only reference to 0
void ZZX::swap(ZZX& x);
void swap(ZZX& x, ZZX& y);
// swap (by swapping pointers)
ZZX::ZZX(long i, const ZZ& c);
ZZX::ZZX(long i, long c);
// initial value c*X^i, provided for backward compatibility
|