281 search results - page 49 / 57 » Better Polynomial Algorithms on Graphs of Bounded Rank-Width |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...
COCO
2010
Springer
13 years 11 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
ICALP
2005
Springer
14 years 27 days ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
VMCAI
2010
Springer
14 years 4 months ago
2010
Springer
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition gra...
SIGAL
1990
13 years 11 months ago
1990
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...