Sciweavers

9842 search results - page 213 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
COCOON
2005
Springer
14 years 4 months ago
Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
Jinsong Tan, Kok Seng Chua, Louxin Zhang
CP
2006
Springer
14 years 21 days ago
Distributed Stable Matching Problems with Ties and Incomplete Lists
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
Ismel Brito, Pedro Meseguer
FOCS
1997
IEEE
14 years 3 months ago
Making Nondeterminism Unambiguous
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of pr...
Klaus Reinhardt, Eric Allender
EATCS
2002
46views more  EATCS 2002»
13 years 10 months ago
Understanding the Mulmuley-Sohoni Approach to P vs. NP
We explain the essence of K. Mulmuley and M. Sohoni, "Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems" [MS02] for a general complexity-the...
Kenneth W. Regan
CP
2009
Springer
14 years 11 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný