1772 search results - page 23 / 355 » Classifying Problems into Complexity Classes |
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
We study the domain of dominant competence of six popular classifiers in a space of data complexity measurements. We observe that the simplest classifiers, nearest neighbor and li...
GD
2009
Springer
13 years 11 months ago
2009
Springer
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
WG
2007
Springer
14 years 1 months ago
2007
Springer
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...