1688 search results - page 234 / 338 » The Complexity of Rationalizing Matchings |
106
click to vote
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
ICDCS
2005
IEEE
15 years 4 months ago
2005
IEEE
IT today is driven by the trend of increasing scale and complexity. Utility and Grid computing models, PlanetLab, and traditional data centers, are reaching the scale of thousands...
102
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
117
click to vote
ECBS
1999
IEEE
15 years 3 months ago
1999
IEEE
Engineering systems are becoming increasingly complex as state of the art technologies are incorporated into designs. Surety modeling and analysis is an emerging science which per...
119
click to vote
DAC
1998
ACM
15 years 3 months ago
1998
ACM
We present a technique for synthesizing power- as well as area-optimized circuits from hierarchical data flow graphs under throughput constraints. We allow for the use of complex...