You have Guest access.
Log In
Volume 1 / 1991 - Volume 20 / 2011
309-315
On lower bounds for the complexity of polynomials and their multiples
W. Baur and K. Halupczok
316-329
Complexity lower bounds for randomized computation trees over zero characteristic fields
D. Grigoriev
330-345
Interactive protocols over the reals
S. Ivanov and M. de Rougemont
346-356
Function algebraic characterizations of the polytime functions
H. Ishihara
357-370
On P versus NP Ç \cap co-NP for decision trees and read-once branching programs
S. Jukna, A. Razborov, P. Savicky and I. Wegener
371-392
Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape
M. Dietzfelbinger and M. Hühne
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info