You have Guest access.
Log In
Volume 1 / 1991 - Volume 20 / 2011
93-116
Two oracles that force a big crunch
H. Buhrman, S. Fenner, L. Fortnow and L. Torenvliet
117-138
Reducing the complexity of reductions
M. Agrawal, E. Allender, R. Impagliazzo, T. Pitassi and S. Rudich
139-154
Complexity of Positivstellensatz proofs for the knapsack
D. Grigoriev
155-178
On the size of randomized OBDDs and read-once branching programs for k-stable functions
M. Sauerhoff
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