Home
last modified time | relevance | path

Searched refs:trialdiv (Results 1 – 25 of 46) sorted by relevance

12

/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/base/simple_classes/factorization/
H A Dtrialdiv.cc33 trialdiv(lidia_size_t index, unsigned int lower_bound, in trialdiv() function in LiDIA::rational_factorization
141 trialdiv(index, lower_bound, upper_bound, prim); in trialdiv_comp()
149 trialdiv(unsigned int upper_bound, unsigned int lower_bound) in trialdiv() function in LiDIA::rational_factorization
166 trialdiv(index, lower_bound, upper_bound, prim); in trialdiv()
174 rational_factorization trialdiv(const bigint &N, unsigned int upper_bound, in trialdiv() function
179 f.trialdiv(upper_bound, lower_bound); in trialdiv()
H A Drational_factorization.cc1252 trialdiv(index, 1, 1000000, prim); in factor_comp()
1382 trialdiv(index, 1, 1000000, prim); in factor()
/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/number_fields/include/LiDIA/number_fields/
H A Dsf_alg_ideal.h285 factorization< alg_ideal > trialdiv(unsigned int upper_bound = 1000000,
287 void trialdiv(factorization< alg_ideal > &,
290 friend factorization< alg_ideal > trialdiv(const alg_ideal &,
293 friend void trialdiv(factorization< alg_ideal > &, const alg_ideal &,
377 factorization< alg_ideal > trialdiv(const alg_ideal &,
380 void trialdiv(factorization< alg_ideal > &, const alg_ideal &,
/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/number_fields/algebraic_num/factorization/
H A Dsf_alg_ideal.cc590 single_factor< alg_ideal >::trialdiv(unsigned int upper_bound, in trialdiv() function in LiDIA::single_factor
594 trialdiv(fact, upper_bound, lower_bound); in trialdiv()
600 void single_factor< alg_ideal >::trialdiv(factorization< alg_ideal > &fact, in trialdiv() function in LiDIA::single_factor
614 rf.trialdiv(upper_bound, lower_bound); in trialdiv()
622 rf.trialdiv(upper_bound, lower_bound); in trialdiv()
633 factorization< alg_ideal > trialdiv(const alg_ideal &a, in trialdiv() function
638 (static_cast< single_factor< alg_ideal > >(a)).trialdiv(fact, upper_bound, lower_bound); in trialdiv()
644 void trialdiv(factorization< alg_ideal > &fact, const alg_ideal &a, in trialdiv() function
648 (static_cast< single_factor< alg_ideal > >(a)).trialdiv(fact, upper_bound, lower_bound); in trialdiv()
/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/base/include/LiDIA/
H A Drational_factorization.h107 void trialdiv(lidia_size_t index, unsigned int lower_bound,
222 void trialdiv(unsigned int upper_bound = 1000000,
239 friend rational_factorization trialdiv(const bigint & N,
302 rational_factorization trialdiv(const bigint & N,
/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/doc/
H A Dsf_alg_ideal.tex157 \begin{cfcode}{factorization< alg_ideal >}{$a$.trialdiv}{unsigned int $\upperbound$ = 1000000,
159 returns the factorization of \code{$a$.base()} using the function \code{trialdiv} of class
164 \begin{fcode}{factorization< alg_ideal >}{trialdiv}{const alg_ideal & $a$,
166 returns the factorization of $a$ using the function \code{trialdiv} of class
171 \begin{cfcode}{void}{$a$.trialdiv}{factorization< alg_ideal > & $\fact$,
173 stores the factorization of \code{$a$.base()} to $\fact$ using the function \code{trialdiv} of
178 \begin{fcode}{void}{trialdiv}{factorization< alg_ideal > & $\fact$, const alg_ideal & $a$,
180 stores the factorization of $a$ to $\fact$ using the function \code{trialdiv} of class
H A Dfact.tex307 \begin{fcode}{void}{$a$.trialdiv}{unsigned int $\upperbound$ = 1000000, unsigned int $\lowerbound$ …
313 \begin{fcode}{rational_factorization}{trialdiv}{const bigint & $N$,
519 with the function \code{trialdiv()}, that there are no such small prime factors left before
548 f.trialdiv(); // calculate prime factorization using trialdiv
/dports/math/reduce/Reduce-svn5758-src/packages/int/
H A Dtrialdiv.red1 module trialdiv; % Trial division routines.
31 exports countz,findsqrts,findtrialdivs,trialdiv,simp,mksp;
106 symbolic procedure trialdiv(x,dl);
H A Dtrcase.red79 simpint1,solve!-for!-u,sqfree,sqmerge,sqrt2top,substinulist,trialdiv,
116 divlist := trialdiv(denr unintegrand,divlist);
H A Dint.red37 halfangl trialdiv vect dint), % simplog
/dports/security/p5-Crypt-Primes/Crypt-Primes-0.50/lib/Crypt/
H A DPrimes.pm622 if ( trialdiv ( $n, $B ) ) {
661 sub trialdiv { subroutine
/dports/security/p5-Crypt-Primes/Crypt-Primes-0.50/
H A DChanges9 * Patch by Dave Paris to fix a limit problem in trialdiv().
H A DREADME95 trialdiv($n,$limit)
100 automatically. trialdiv() is used by maurer() to weed out
/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/ec_order/eco_gf2n/eco_gf2n/
H A Dverify_strong_curve_appl.cc98 rf.trialdiv(); in main_LiDIA()
H A Dfind_curve_gf2n_appl.cc284 rf.trialdiv(); in main_LiDIA()
307 rf.trialdiv(); in main_LiDIA()
/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/gec/
H A Dgec.cc474 delta_factored.trialdiv(); in compute_delta_field()
488 delta_factored.trialdiv(); in compute_delta_field()
H A Dis_cryptographically_strong.cc136 trialdiv( tmp_r, upper_bound_k_as_int, 5 ); in is_cryptographically_strong()
/dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/misc/
H A Dphi.c84 trialdiv (mpz_t R, int *p, int *v, uint maxp, uint flen) in trialdiv() function
151 k = trialdiv (R, p, v, maxp, flen); in autodet()
584 k = trialdiv (R, p, vp, maxp, flen); in main()
H A Dconvert_rels.cpp505 trialdiv (unsigned long *primes, unsigned long *exps, unsigned int *n, in trialdiv() function
883 trialdiv (rel->sprimes, rel->sexp, &rel->sp_entries, norm); in read_relation_ggnfs()
/dports/math/aribas/aribas-1.64/examples/
H A Dfactor.ari20 ** for example using the function trialdiv (below).
24 ** ==> trialdiv(10**15+1).
39 function trialdiv(x: integer): array;
/dports/math/aribas/aribas-1.64/src/
H A Daritx.c65 PUBLIC unsigned trialdiv _((word2 *x, int n, unsigned u0, unsigned u1));
303 while(trialdiv(x,n,3,0xFFFB))
506 u = trialdiv(x,n,u0,u1);
536 PUBLIC unsigned trialdiv(x,n,u0,u1) in trialdiv() function
/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/finite_fields/factorization/Fp_polynomial/
H A Dbinomial.cc81 f.trialdiv(mm); in order_mod()
/dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/sieve/
H A Dtrialdiv.cpp312 #error trialdiv not implemented for input sizes of more than 8 words in trial_divide()
/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/ec_order/eco_gfp/eco_gfp/
H A DEC_domain_parameters_P1363.cc616 rf_order.trialdiv(); in is_strong_curve()
/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/library/base/
H A DMakefile.in137 rational_factorization.lo trialdiv.lo lanczos.lo \
632 $(LIDIA_BASE_SRCDIR)/simple_classes/factorization/trialdiv.cc \
1121 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/trialdiv.Plo@am__quote@
2060 trialdiv.lo: $(LIDIA_BASE_SRCDIR)/simple_classes/factorization/trialdiv.cc
2061 …trialdiv.lo -MD -MP -MF $(DEPDIR)/trialdiv.Tpo -c -o trialdiv.lo `test -f '$(LIDIA_BASE_SRCDIR)/si…
2062 @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/trialdiv.Tpo $(DEPDIR)/trialdiv.Plo
2065 …trialdiv.lo `test -f '$(LIDIA_BASE_SRCDIR)/simple_classes/factorization/trialdiv.cc' || echo '$(sr…

12