• Oracles and queries that are sufficient for exact learning 

      Bhousty, Nader H.; Cleve, Richard; Gavaldà Mestre, Ricard; Kannan, Sampath; Tamon, Christino (1994-08)
      Report de recerca
      Accés obert
      We show that the class of all circuits is exactly learnable in randomized expected polynomial time using weak subset and weak superset queries. This is a consequence of the following result which we consider to be of ...