Using Approximation Hardness to Achieve Dependable Computation
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
| Hi-index | 0.00 |
Please don't be shy about sending even vague pointers to people who may have complete or partial resolutions of the problems mentioned in any of the open questions columns that have appeared as earlier complexity theory columns. Though I don't give a dollar for each solved problem (what do you expect on a theoretician's salary!), I'll be delighted to report in this space on resolutions (such as the thrilling resolution by Cai and Sivakumar that was mentioned in the previous column). Without further delay, here is this issue's guest column, by Mihir Bellare.