You have Guest access.
Log In
Volume 1 / 1991 - Volume 20 / 2011
203-226
Lower bounds for the multiplicative complexity of matrix multiplication
M. Bläser
227-257
Solvability of systems of polynomial congruences modulo a large prime
M.-D. Huang and Y.-C. Wong
258-272
Lower bounds for modular counting by circuits with modular gates
D. A. Mix Barrington and H. Straubing
273-307
On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games
M. Liskiewicz and R. Reischuk
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