View Single Post
Old 08-28-2012, 11:52 AM
ramin ramin is offline
Junior Member
Join Date: Jul 2012
Posts: 6
Default computational complexity?


Professor Abu-Mostafa at times mentions computational complexity of different learning tasks (for example,I think he mentioned general solution to RBF with the width parameters is NP hard?). In addition, he sometimes refers to function approximation formulations of certain problems. Are there good introductory references to these two topics ?
Reply With Quote