876 search results - page 9 / 176 » New Results for the Martin Polynomial |
LICS
2010
IEEE
13 years 6 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
FCSC
2008
13 years 8 months ago
2008
Abstract. We discuss the verification of mathematical software solving polynomial systems symbolically by way of triangular decomposition. Standard verification techniques are high...
EXACT
2009
13 years 6 months ago
2009
This paper addresses the issue of the explanation of the result given to the end-user by a classifier, when it is used as a decision support system. We consider machine learning cl...
ECAI
2010
Springer
13 years 6 months ago
2010
Springer
This paper addresses the issue of supporting the end-user of a classifier, when it is used as a decision support system, to classify new cases. We consider several kinds of classif...
LICS
2008
IEEE
14 years 3 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...