Deterministic equation solving over finite fields
From MaRDI portal
Publication:5262784
DOI10.1145/1073884.1073932zbMATH Open1360.11146OpenAlexW2054140003MaRDI QIDQ5262784FDOQ5262784
Authors: Christiaan E. van de Woestijne
Publication date: 16 July 2015
Published in: Proceedings of the 2005 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1073884.1073932
Recommendations
Cited In (12)
- On Existence (Based on an Arithmetical Problem) and Constructions of Bent Functions
- An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
- Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\)
- Sequences of irreducible polynomials without prescribed coefficients over odd prime fields
- Counting solutions to equations in many variables over finite fields
- On Solving Systems of Diagonal Polynomial Equations Over Finite Fields
- From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces
- Deterministically generating Picard groups of hyperelliptic curves over finite fields
- Trading GRH for algebra: algorithms for factoring polynomials and related structures
- Identifying the Matrix Ring: Algorithms for Quaternion Algebras and Quadratic Forms
- Noncanonical number systems in the integers
- Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing
This page was built for publication: Deterministic equation solving over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262784)