Login / Signup

Regular Languages Are Testable with a Constant Number of Queries.

Noga AlonMichael KrivelevichIlan NewmanMario Szegedy
Published in: FOCS (1999)
Keyphrases
  • query processing
  • small number
  • database
  • databases
  • computational complexity
  • dynamic programming
  • query language