Login / Signup

The asymptotic behavior of N-adic complexity.

Andrew Klapper
Published in: Adv. Math. Commun. (2007)
Keyphrases
  • worst case
  • computational complexity
  • databases
  • decision problems
  • neural network
  • real world
  • information retrieval
  • cooperative
  • digital libraries
  • upper bound
  • high computational complexity