Login / Signup

Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound.

Tim BlackmoreGraham H. Norton
Published in: SIAM J. Discret. Math. (2001)
Keyphrases
  • worst case
  • upper bound
  • database
  • lower bound
  • state space
  • real time
  • error bounds
  • databases
  • e learning
  • website
  • image sequences
  • multiscale
  • search algorithm
  • model checking
  • space complexity