On upper bound of the complexity of quasi polynomial representations of functions over finite fields (Q307745): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
 
(2 intermediate revisions by 2 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11T06 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11Y16 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6623288 / rank
 
Normal rank
Property / zbMATH Keywords
 
finite field
Property / zbMATH Keywords: finite field / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial
Property / zbMATH Keywords: polynomial / rank
 
Normal rank
Property / zbMATH Keywords
 
quasi polynomial
Property / zbMATH Keywords: quasi polynomial / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:57, 4 March 2024

scientific article
Language Label Description Also known as
English
On upper bound of the complexity of quasi polynomial representations of functions over finite fields
scientific article

    Statements

    On upper bound of the complexity of quasi polynomial representations of functions over finite fields (English)
    0 references
    5 September 2016
    0 references
    finite field
    0 references
    polynomial
    0 references
    quasi polynomial
    0 references
    complexity
    0 references

    Identifiers