Pages that link to "Item:Q1825030"

The following pages link to Deterministic irreducibility testing of polynomials over large finite fields (Q1825030):

Displaying 14 items.

• Computational problems in the theory of finite fields (Q1180998) (← links)
• A heuristic irreducibility test for univariate polynomials (Q1186702) (← links)
• Computing the irreducible real factors and components of an algebraic curve (Q1814128) (← links)
• Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
• Smoothness testing of polynomials over finite fields (Q2513763) (← links)
• Deterministic distinct-degree factorization of polynomials over finite fields (Q2643572) (← links)
• Analysis of Rabin's irreducibility test for polynomials over finite fields (Q2772930) (← links)
• Optimal testing of multivariate polynomials over small prime fields (Q2840981) (← links)
• (Q3005904) (← links)
• (Q3570803) (← links)
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900933) (← links)
• The computational complexity of recognizing permutation functions (Q5917358) (← links)
• Factoring polynomials over finite fields: A survey (Q5928877) (← links)
• Absolute irreducibility of polynomials via Newton polytopes (Q5936184) (← links)