Login / Signup

A Pascal-like bound for the number of necklaces with fixed density.

István HeckenbergerJoe Sawada
Published in: Theor. Comput. Sci. (2019)
Keyphrases
  • small number
  • fixed number
  • real time
  • data sets
  • data mining
  • genetic algorithm
  • information systems
  • upper bound
  • databases
  • three dimensional
  • computational complexity
  • lower bound
  • low density