9842 search results - page 2 / 1969 » The Complexity of the Matching-Cut Problem |
CORR
2002
Springer
14 years 9 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...
78
Voted
TCS
2011
14 years 4 months ago
2011
Abstract. We consider the complexity of the traveling tournament problem, which is a well-known benchmark problem in tournament timetabling. The problem was supposed to be computat...
COCO
1995
Springer
15 years 1 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
LICS
1999
IEEE
15 years 1 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
STACS
2010
Springer
15 years 1 months ago
2010
Springer
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...