Proceedings of the Ninth Annual Structure in Complexity Theory Conference: June 28-July 1, 1994 Amsterdam, the Netherlands/94Ch3423-1

Front Cover
IEEE Computer Soc. Press, 1994 - Complexity Theory - 397 pages
0 Reviews
Papers presented at the Ninth Annual Structure in Complexity Theory Conference, held in Amsterdam, June-July 1994. Among the topics: on the query complexity of clique size and maximum satisfiability; the complexity world below logarithmic space; on the structure of complete sets; time, hardware, and uniformity; predicate classes and promise classes; random debaters and the hardness of approximating stochastic functions; and the complexity of learning with queries. No index. Annotation copyright by Book News, Inc., Portland, OR

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.


Approximate Sets
On the Query Complexity of Clique Size and Maximum Satisfiability
Using Bounded Query Classes to Separate Classes in the Exponential

18 other sections not shown

Common terms and phrases

Bibliographic information