View Single Post
Old 01-28-2013, 07:20 AM
palmipede palmipede is offline
Join Date: Jan 2013
Posts: 13
Default Re: Q5, K dependency on N?

Speaking of computational complexity, some hard problems like boolean satisfiability (e.g. 3-SAT) have been observed to have easy solution times for the average random instances of the problem but is no practical upper bound on the solution times of the worst cases.

I wonder what does that mean for learning? Are there known cases of phase transition in learning time?
Reply With Quote