1450 search results - page 47 / 290 » On the Complexity of Hardness Amplification |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionali...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
COCO
2004
Springer
14 years 1 months ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...