10988 search results - page 200 / 2198 » Algorithmic Folding Complexity |
124
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
Recent work by Procaccia, Rosenschein and Zohar [14] established some results regarding the complexity of manipulation and control in elections with multiple winners, such as elec...
146
Voted
IS
2008
15 years 3 months ago
2008
Discovering patterns with highly significance is an important problem in data mining discipline. An episode is defined to be a partially ordered set of events for a consecutive an...
129
Voted
ICLP
2001
Springer
15 years 8 months ago
2001
Springer
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
131
Voted
ENDM
2006
15 years 3 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
105
Voted
GC
2002
Springer
15 years 3 months ago
2002
Springer
It is shown that the Hilbert series of the face ring of a clique complex (equivalently, flag complex) of a graph G is, up to a factor, just a specialization of SG (x, y), the subg...