Computational Complexity

 


Creative Commons License
This work is licensed under a Creative Commons License.

Powered by Blogger™

Tuesday, October 01, 2002

 
SIGACT News

Posted by Lance

Lane Hemaspaandra's Complexity Column in the September SIGACT News has an interesting article by Marcus Schaefer and Chris Umans on problems complete in higher levels of the polynomial-time hierarchy. Also of interest for complexity theorists, Bill Gasarch's Book Review Column has a joint review of Computability and Complexity Theory by Homer and Selman and The Complexity Theory Companion by Hemaspaandra and Ogihara.

4:41 PM # 0 comments

Comment Feeds: This Post All

Links to this post:

Create a Link

Weblog Home

Archives