Sciweavers

29908 search results - page 12 / 5982
» On the Complexity of
Sort
View
ECCC
2007
90views more  ECCC 2007»
13 years 7 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
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
ER
2005
Springer
94views Database» more  ER 2005»
14 years 1 months ago
Topological Relationships Between Complex Lines and Complex Regions
Abstract. Topological relationships between spatial objects in the twodimensional space have been investigated for a long time in a number of disciplines like artificial intellige...
Markus Schneider, Thomas Behr