𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[ACM Press the 42nd ACM symposium - Cambridge, Massachusetts, USA (2010.06.05-2010.06.08)] Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 - Improving exhaustive search implies superpolynomial lower bounds

✍ Scribed by Williams, Ryan

Book ID
121732356
Publisher
ACM Press
Year
2010
Weight
610 KB
Category
Article
ISBN
1450300502

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

[ACM Press the 42nd ACM symposium - Camb
[ACM Press the 42nd ACM symposium - Cambridge, Massachusetts, USA (2010.06.05-2010.06.08)] Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 - Distributed computation in dynamic networks
✍ Kuhn, Fabian; Lynch, Nancy; Oshman, Rotem πŸ“‚ Article πŸ“… 2010 πŸ› ACM Press 🌐 English βš– 445 KB

In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the communication links for each round are chosen by an adversary, and nodes do not know who their neighbors for the current rou

[ACM Press the 42nd ACM symposium - Camb
[ACM Press the 42nd ACM symposium - Cambridge, Massachusetts, USA (2010.06.05-2010.06.08)] Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 - A shorter proof of the graph minor algorithm
✍ Kawarabayashi, Ken-ichi; Wollan, Paul πŸ“‚ Article πŸ“… 2010 πŸ› ACM Press 🌐 English βš– 481 KB

At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful theorem which describes the structure of graphs excluding a fixed minor. This result is used to prove Wagner's conjecture and provide a polynomial time algorithm for the disjoint paths problem when the number of the