登入選單
返回Google圖書搜尋
註釋Contains 27 papers from the June conference, plus texts on which survey talks at the conference were based. Some topics include the general notion of a dot-operator, polynomial vicinity circuits and nonlinear lower bounds, complexity and expressive power of logic programming, upper and lower bounds for some depth-3 circuit classes, time bounded frequency computations, communication complexity of the universal relation, and the bottleneck counting argument. No index. Annotation copyrighted by Book News, Inc., Portland, OR.