- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
Intersection distribution of degree four polynomials over finite fields ; day:4 ; month:10 ; year:2024 ; pages:1-23
Designs, codes and cryptography ; (4.10.2024), 1-23
- Creator
-
Li, Shuxing
Xiong, Maosheng
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10623-024-01488-6
- URN
-
urn:nbn:de:101:1-2412202124564.408380858745
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:31 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Li, Shuxing
- Xiong, Maosheng
- SpringerLink (Online service)
Other Objects (12)
A recurrent construction of irreducible polynomials of fixed degree over finite fields
Low-Degree Approximation of Random Polynomials
A CHARACTERIZATION OF LOW DEGREE POLYNOMIALS
Finite free convolutions of polynomials
Finite combinatory logic with intersection types
Factorization of quaternionic polynomials of bi-degree (n,1)
All complete intersection Calabi-Yau four-folds
Approximate degree and quantum query lower bounds via dual polynomials
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials
A FUNCTIONAL EQUATION CHARACTERIZING LOW DEGREE POLYNOMIALS IN TWO VARIABLES
A new kind of polynomials for finite groups
On the Koebe Quarter Theorem for Certain Polynomials of Even Degree
A recurrent construction of irreducible polynomials of fixed degree over finite fields
Low-Degree Approximation of Random Polynomials
A CHARACTERIZATION OF LOW DEGREE POLYNOMIALS
Finite free convolutions of polynomials
Finite combinatory logic with intersection types
Factorization of quaternionic polynomials of bi-degree (n,1)
All complete intersection Calabi-Yau four-folds
Approximate degree and quantum query lower bounds via dual polynomials
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials
A FUNCTIONAL EQUATION CHARACTERIZING LOW DEGREE POLYNOMIALS IN TWO VARIABLES
A new kind of polynomials for finite groups
On the Koebe Quarter Theorem for Certain Polynomials of Even Degree
A recurrent construction of irreducible polynomials of fixed degree over finite fields
Low-Degree Approximation of Random Polynomials
A CHARACTERIZATION OF LOW DEGREE POLYNOMIALS
Finite free convolutions of polynomials
Finite combinatory logic with intersection types
Factorization of quaternionic polynomials of bi-degree (n,1)
All complete intersection Calabi-Yau four-folds
Approximate degree and quantum query lower bounds via dual polynomials
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials
A FUNCTIONAL EQUATION CHARACTERIZING LOW DEGREE POLYNOMIALS IN TWO VARIABLES
A new kind of polynomials for finite groups