On lower bounds for the complexity of polynomials and their multiples W. BaurK. Halupczok Pages: 309 - 315
Complexity lower bounds for randomized computation trees over zero characteristic fields D. Grigoriev Pages: 316 - 329
On P versus NP $ \cap $ co-NP for decision trees and read-once branching programs S. JuknaA. RazborovI. Wegener Pages: 357 - 370
Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape M. DietzfelbingerM. Hühne Pages: 371 - 392