This is the final part of a 2-part column on the future of computational complexity theory. The grounds rules were that the contributors had no restrictions (except a 1-page limit). For readers interested in more formal reports, in addition to the two URLs mentioned in the previous issue (ftp://ftp.cs.washington.edu/tr/1996/O3/UW-CSE-96-O3-O3.PS.Z and http://theory.lcs.mit.edu/-oded/toc-sp.html) I would also point to the recent "Strategic Directions" report (http://geisel.csl.uiuc.edu/-loui/complete.html).Coming during the next few issues: the search for the perfect theory journal; Thomas Jefferson exposed as a theoretical computer scientist; and Mitsunori Ogihara's survey of DNA-based computation. (The "Lance Fortnow in a clown suit" article promised in the previous column actually ran stand-alone last issue due to scheduling; it probably is still available at a library near you!) Finally, some recent work by Edith Hemaspaandra, Harald Hempel, and myself, and of Buhrman and Fortnow, partially resolves one of the open questions from Complexity Theory Column 11.
End of preview. The entire article is 5 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/the-future-of-computational-complexity-theory-part-ii-DlVVt9s4KY
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
The future of computational complexity theory: part II
Allender, E.; Feigenbaum, J.; Goldsmith, J.; Pitassi, T.; Rudich, S.
Follow ACM SIGACT News
, Volume 27 (4)
Association for Computing Machinery – Dec 1, 1996
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
