Sciweavers

28888 search results - page 38 / 5778
» Computability and complexity in analysis
Sort
View
JC
2007
130views more  JC 2007»
13 years 7 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
SI3D
2003
ACM
14 years 1 months ago
Interactive navigation in complex environments using path planning
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
Brian Salomon, Maxim Garber, Ming C. Lin, Dinesh M...
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
11 years 10 months 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
ATAL
2008
Springer
13 years 9 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
13 years 6 months ago
On the complexity of optimal reconfiguration planning for modular reconfigurable robots
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
Feili Hou, Wei-Min Shen