Login / Signup

A Characterization of the Class of Functions Computable in Polynomial Time on Random Access Machines

Alberto BertoniGiancarlo MauriNicoletta Sabadini
Published in: STOC (1981)
Keyphrases
  • random access
  • turing machine
  • finite sets
  • disk storage
  • solid state
  • multiview video coding
  • learning machines
  • special case
  • motion estimation
  • image quality
  • positive data
  • memory size