Pages that link to "Item:Q3728101"

The following pages link to Factorization of Multivariate Polynomials Over Finite Fields (Q3728101):

Displaying 17 items.

• Counting curves and their projections (Q677992) (← links)
• An empirical study of cache-oblivious polygon indecomposability testing (Q975317) (← links)
• Parallel methods for absolute irreducibility testing (Q1009361) (← links)
• Factoring sparse multivariate polynomials (Q1080656) (← links)
• Irreducibility of multivariate polynomials (Q1083191) (← links)
• Factoring polynomials and primitive elements for special primes (Q1095971) (← links)
• Deterministic irreducibility testing of polynomials over large finite fields (Q1825030) (← links)
• Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics. (Q1867478) (← links)
• Irreducible compositions of polynomials over finite fields of even characteristic (Q1928790) (← links)
• Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem (Q2068390) (← links)
• Complexity of solving parametric polynomial systems (Q2256707) (← links)
• Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
• Theory of computational complexity. Part 9. Transl. from the Russian. (Q2494566) (← links)
• Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785) (← links)
• Deterministic distinct-degree factorization of polynomials over finite fields (Q2643572) (← links)
• Factoring Multivariate Polynomials over Large Finite Fields (Q3478494) (← links)
• Values of polynomials over finite fields (Q3495444) (← links)