Pages that link to "Item:Q3497178"
From MaRDI portal
The following pages link to New Algorithms for Finding Irreducible Polynomials Over Finite Fields (Q3497178):
Displayed 49 items.
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Hadamard tensors and lower bounds on multiparty communication complexity (Q371197) (← links)
- A general construction for monoid-based knapsack protocols (Q476358) (← links)
- Explicit computation of isomorphisms between finite fields (Q700165) (← links)
- A correspondence of certain irreducible polynomials over finite fields (Q765810) (← links)
- Deterministically generating Picard groups of hyperelliptic curves over finite fields (Q897576) (← links)
- On the construction of a family of transversal subspaces over finite fields (Q929484) (← links)
- Fast arithmetic in unramified \(p\)-adic fields (Q973961) (← links)
- The complexity of the matroid-greedoid partition problem (Q1006060) (← links)
- Hardness results and spectral techniques for combinatorial problems on circulant graphs (Q1124798) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Computational problems in the theory of finite fields (Q1180998) (← links)
- Finding irreducible and primitive polynomials (Q1311621) (← links)
- Randomness in interactive proofs (Q1321030) (← links)
- On some approximation problems concerning sparse polynomials over finite fields (Q1351508) (← links)
- On finding primitive roots in finite fields (Q1351512) (← links)
- PSPACE has constant-round quantum interactive proof systems (Q1870552) (← links)
- On multi-partition communication complexity (Q1886038) (← links)
- Computational indistinguishability: A sample hierarchy (Q1961376) (← links)
- Representative families for matroid intersections, with applications to location, packing, and covering problems (Q2028091) (← links)
- The Chebotarev density theorem for function fields -- incomplete intervals (Q2031634) (← links)
- Lower bounds for matrix factorization (Q2041242) (← links)
- Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time (Q2205636) (← links)
- Fast amortized multi-point evaluation (Q2238846) (← links)
- Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
- Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\) (Q2366272) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- Counting irreducible binomials over finite fields (Q2634386) (← links)
- Constructing normal bases in finite fields (Q2639102) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- Standard generators of finite fields and their cyclic subgroups (Q2687267) (← links)
- Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields (Q2719077) (← links)
- Constructing irreducible polynomials over finite fields (Q2894527) (← links)
- Cryptographic hash functions from sequences of lifted Paley graphs (Q2975257) (← links)
- Efficient Finite Fields in the Maxima Computer Algebra System (Q3519552) (← links)
- Searching for Primitive Roots in Finite Fields (Q3987942) (← links)
- Algorithms in Algebraic Number Theory (Q4005808) (← links)
- Some results on uniform arithmetic circuit complexity (Q4285623) (← links)
- Computing isomorphisms and embeddings of finite fields (Q4612574) (← links)
- Constructing nonresidues in finite fields and the extended Riemann hypothesis (Q4889937) (← links)
- A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem (Q4957916) (← links)
- Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) (Q5066949) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- On Sets of Irreducible Polynomials Closed by Composition (Q5267794) (← links)
- Explicit Near-Ramanujan Graphs of Every Degree (Q5856148) (← links)
- Factoring polynomials over special finite fields (Q5927536) (← links)
- Factoring polynomials over finite fields: A survey (Q5928877) (← links)
- Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) (Q6118641) (← links)
- Ideal uniform multipartite secret sharing schemes (Q6192308) (← links)