1772 search results - page 214 / 355 » Classifying Problems into Complexity Classes |
127
click to vote
IANDC
2006
15 years 22 days ago
2006
This paper studies efficient learning with respect to mind changes. Our starting point is the idea that a learner that is efficient with respect to mind changes minimizes mind cha...
112
click to vote
JGAA
2006
15 years 21 days ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
108
Voted
FOSSACS
2008
Springer
15 years 2 months ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
206
Voted
ICDT
2009
ACM
16 years 1 months ago
2009
ACM
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
115
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...