The following pages link to Joachim von zur Gathen (Q165879):
Displaying 50 items.
- Counting decomposable multivariate polynomials (Q429753) (← links)
- Circulant graphs and GCD and LCM of subsets (Q477605) (← links)
- Average order in cyclic groups (Q558183) (← links)
- Fast arithmetic with general Gauß periods (Q598216) (← links)
- Counting curves and their projections (Q677992) (← links)
- Efficient and optimal exponentiation in finite fields (Q685709) (← links)
- Functional decomposition of polynomials: the tame case (Q753496) (← links)
- Functional decomposition of polynomials: the wild case (Q755793) (← links)
- Shifted varieties and discrete neighborhoods around varieties (Q820939) (← links)
- Analysis of Euclidean algorithms for polynomials over finite fields (Q912620) (← links)
- Counting reducible and singular bivariate polynomials (Q958607) (← links)
- Approximate polynomial GCD: small degree and small height perturbations (Q979147) (← links)
- Factoring sparse multivariate polynomials (Q1080656) (← links)
- Irreducibility of multivariate polynomials (Q1083191) (← links)
- Factoring polynomials and primitive elements for special primes (Q1095971) (← links)
- Permanent and determinant (Q1097929) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- Some polynomials that are hard to compute (Q1143788) (← links)
- Processor-efficient exponentiation in finite fields (Q1186580) (← links)
- Factoring modular polynomials (Q1273766) (← links)
- Polynomials with two values (Q1276272) (← links)
- Tests for permutation functions (Q1344091) (← links)
- Orders of Gauss periods in finite fields (Q1389144) (← links)
- Subresultants revisited. (Q1401299) (← links)
- Multivariate polynomial decomposition (Q1405741) (← links)
- Algorithms for exponentiation in finite fields (Q1581128) (← links)
- Complexity of some arithmetic problems for binary polynomials (Q1889852) (← links)
- Lower bounds for decomposable univariate wild polynomials (Q1930181) (← links)
- The number of reducible space curves over a finite field (Q1938580) (← links)
- Counting invariant subspaces and decompositions of additive polynomials (Q1994893) (← links)
- Normal form for Ritt's second theorem (Q2253092) (← links)
- Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
- Interval partitions and polynomial factorization (Q2429339) (← links)
- Compositions and collisions at degree \(p^2\) (Q2437328) (← links)
- Polynomial and normal bases for finite fields (Q2499258) (← links)
- GCD of random linear combinations (Q2509027) (← links)
- Inversion in finite fields using logarithmic depth (Q2638778) (← links)
- Maximal bilinear complexity and codes (Q2638779) (← links)
- Boolean circuits versus arithmetic circuits (Q2639101) (← links)
- Constructing normal bases in finite fields (Q2639102) (← links)
- (Q2708610) (← links)
- (Q2712109) (← links)
- CryptoSchool (Q2792595) (← links)
- Survey on Counting Special Types of Polynomials (Q2808004) (← links)
- Modern Computer Algebra (Q2862994) (← links)
- Generating safe primes (Q2873165) (← links)
- The number of decomposable univariate polynomials. extended abstract (Q2883840) (← links)
- Composition collisions and projective polynomials (Q2946530) (← links)
- Decomposition of generic multivariate polynomials (Q2946531) (← links)
- Irreducible trinomials over finite fields (Q2958953) (← links)
