Sciweavers

13621 search results - page 6 / 2725
» Computability and Complexity in Self-assembly
Sort
View
JC
2007
130views more  JC 2007»
13 years 9 months ago
On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
Peter Scheiblechner
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
12 years 7 days ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák