On the complexity of exact counting of dynamically irreducible polynomials.

Domingo Gómez-Pérez László Mérai Igor E. Shparlinski

Published in: J. Symb. Comput. (2020)

Keyphrases

computational complexity
information retrieval
case study
expert systems
worst case
social networks
information systems
decision making
multiscale
lower bound
relational databases
computational cost
exact solution