Login / Signup

What Can be Efficiently Reduced to the K-Random Strings?

Eric AllenderHarry BuhrmanMichal Koucký
Published in: STACS (2004)
Keyphrases
  • uniformly distributed
  • databases
  • case study
  • image sequences
  • randomly generated
  • finite automata