Login / Signup

Queries and Algorithms Computable by Polynomial Time Existential Reflective Machines.

Jerzy Tyszkiewicz
Published in: Fundam. Informaticae (1997)
Keyphrases
  • computational complexity
  • significant improvement
  • database
  • computational cost
  • query language
  • worst case
  • data structure
  • search algorithm
  • access methods
  • turing machine
  • query complexity