Login / Signup

Binary Sequences With Length n and Nonlinear Complexity Not Less Than n/2.

Sicheng LiangXiangyong ZengZibi XiaoZhimin Sun
Published in: IEEE Trans. Inf. Theory (2023)
Keyphrases
  • computational complexity
  • fixed length
  • hidden markov models
  • space complexity
  • decision problems
  • information systems
  • computational cost
  • longest common subsequence
  • finite alphabet