• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

On the Nth maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence.

Zhimin SunXiangyong ZengDa Lin
Published in: Cryptogr. Commun. (2020)
Keyphrases
  • computational complexity
  • artificial intelligence
  • database
  • worst case
  • complexity analysis
  • databases
  • learning algorithm
  • web pages
  • website
  • lower bound
  • upper bound
  • higher order
  • space complexity