Abstract
We study the parameterized complexity of learning k -juntas and some variations of juntas. We show the hardness of learning k -juntas and subclasses of k -juntas in the PAC model by reductions from a W [ 2 ] -complete problem. On the other hand, as a consequence of a more general result, we show that k -juntas are exactly learnable with improper equivalence queries and access to a W [ P ] oracle.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
