Login / Signup

Self-P-Printability and Polynomial Time Turing Equivalence to a Tally Set.

Roy S. Rubinstein
Published in: SIAM J. Comput. (1991)
Keyphrases
  • database
  • special case
  • databases
  • real world
  • lower bound
  • small number
  • worst case
  • logic programs