Login / Signup

On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems.

Shin AidaRainer SchulerTatsuie TsukijiOsamu Watanabe
Published in: STACS (2001)
Keyphrases
  • truth table
  • computational complexity
  • special case
  • learning algorithm
  • query language
  • optimization problems
  • learning theory