1772 search results - page 93 / 355 » Classifying Problems into Complexity Classes |
130
Voted
MST
2007
15 years 2 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
112
Voted
DBPL
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The complexity of containment and satisfiability of conjunctive queries over finite, unranked, labeled trees is studied with respect to the axes Child, NextSibling, the...
90
Voted
MOC
1998
15 years 2 months ago
1998
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
152
Voted
FSTTCS
2010
Springer
15 years 18 days ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
137
Voted
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...