SIGACT news complexity theory column 35
ACM SIGACT News
Computational Politics: Electoral Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
Information Processing Letters
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
The complexity of computing minimal unidirectional covering sets
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
This issue's column surveys recent progress in raising NP-hardness lower bounds to parallel NP lower bounds. Complexity theorists will learn that Lewis Carroll (unbeknownst to himself) was a fellow complexity theorist. So that readers specializing in algorithms don't feel left out, let me mention that they are in even better company. Algorithms for apportioning the US House of Representatives were designed and debated by Adam, Hamilton, Jefferson, Webster, and other famous figures from American history, as recounted in a page-turner by Balinski and Young ([BY82]; see also [BY85] for a shorter take and [HRSZ96] for a more explicitly computational spin). Looking forward, the next issue's column will be a survey, by Mitsunori Ogihara, of DNA-based computing.