Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR95-015 | 6th February 1995 00:00

Oracles and queries that are sufficient for exact learning

RSS-Feed




TR95-015
Authors: Bshouty, Cleve, Gavalda, Kannan, Tamon.
Publication: 1st March 1995 12:05
Downloads: 1278
Keywords: 


Abstract:

We show what happen to learning if the learner can use NP-oracle.
A consequence of our results we show that
If NP\subset P/poly then the polynomial Hierarchy collapses to ZPP^NP

END_OF_DESCRIPTION
Contact: bshouty@cpsc.ucalgary.ca (Nader Bshouty)



ISSN 1433-8092 | Imprint