Report on COMPLEXITY 199 8 The 13th annual conference on Computational Complexity was held i n Buffalo, NY . The conference was sponsored by the IEEE Computer Societ y Technical Committee on Mathematical Foundations of Computing, in cooperation with ACM SIGACT and EATCS, with support from the University a t Buffalo "Conferences in the Disciplines", UB Department of Computer Science and Engineering, and UB Faculty of Natural Sciences and Mathematics . The conference brought together theoretical computer scientists interested i n computational complexity and related fields . The Complexity program committee was composed of Joan Feigenbau m (chair), Richard Beigel, Stephen Fenner, Judy Goldsmith, Martin Kummer , Elvira Mayordomo, Moni Naor, Steven Rudich, Dan spielman and Alan Selman . A total of 43 abstracts and draft papers were submitted, of which 2 4 were accepted for presentation and inclusion in the proceedings . In addition , four members of the program committee contributed survey talks . We wer e 84 people attending the conference, including 28 students . The proceedings were published by the IEEE Computer Society Press . The conference calls for papers on a variety of topics : structure of cornplexity classes, resource-bounded reducibilities, interactive proof
/lp/association-for-computing-machinery/report-on-complexity-1998-a7y7rQRZxV