Optimal Prediction for Prefetching in the Worst Case

  • Authors:
  • P. Krishnan;Jeffrey Scott Vitter

  • Affiliations:
  • -;-

  • Venue:
  • SIAM Journal on Computing
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the learnability of read-k-satisfy-j (RkSj) DNF formulas. These are boolean formulas in disjunctive normal form (DNF), in which the maximum number of occurrences of a variable is bounded by k, and the number of terms satisfied ...