> When I say subclass of inputs, I literally mean inputs, so if say f is > a function in NP, there is some subclass of x, S, such that for all x > in S, T(f(x)) = O(|x|^n). >
Such subclasses are known and studied. For example, the reason that SAT works so well in real life is because almost all real-life problems fall into the subclass! But this is well-known, now, and research has moved on to trying to identify if there are more subclasses which have been missed so far (and/or for which some other algo might be effective). --linas -- You received this message because you are subscribed to the Google Groups "opencog" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/opencog. To view this discussion on the web visit https://groups.google.com/d/msgid/opencog/CAHrUA37jAM%2ByZTDVS73me3HVgSN__nzpzOJDBP_L%2Bgw6UN-CsA%40mail.gmail.com. For more options, visit https://groups.google.com/d/optout.
