1552 search results - page 35 / 311 » On the Complexity of Constant Propagation |
104
click to vote
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
This paper investigates the complexity of the min-max and min-max regret versions of the s−t min cut and min cut problems. Even if the underlying problems are closely related and...
117
click to vote
ICONIP
2010
15 years 13 days ago
2010
Cortical activity exhibits complex, persistent self-sustained dynamics, which is hypothesised to support the brain’s sophisticated processing capabilities. Prior studies have sho...
104
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
155
click to vote
ESA
2003
Springer
15 years 7 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
157
click to vote
STOC
2012
ACM
13 years 4 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...