Theory of Computing Systems
Collection
Collection
- ISSN: 1432-4350
Published by Springer Nature
-
Functions computable with nonadaptive queries to $N{ m P}$ Article
Theory of Computing Systems, 31(1), 77-92.January 1998
-
Some Results on Derandomization Article
Theory of Computing Systems, 38(2), 211-227.January 2005 -
Robust Polynomials and Quantum Algorithms Article
Theory of Computing SystemsH.M. Buhrman (Harry), I. Newman, H. Röhrig (Hein) and R.M. de Wolf (Ronald)
January 2006 -
Robust Polynomials and Quantum Algorithms Article
Theory of Computing Systems, 40(4), 379-395.H.M. Buhrman (Harry), I. Newman, H. Röhrig (Hein) and R.M. de Wolf (Ronald)
January 2007
-
Online k-server routing problems Article
Theory of Computing Systems, 45(3), 470-485.January 2009 -
Depth as Randomness Deficiency Article
Theory of Computing Systems, 45(4), 724-739.L.F. Antunes (Luis), A. Matos, A. Souto (André) and P.M.B. Vitányi (Paul)
July 2009
-
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible? Article
Theory of Computing Systems, 46(1), 143-156.H.M. Buhrman (Harry), L. Fortnow (Lance), M. Koucký (Michal), J. Rogers and N.K. Vereshchagin (Nikolay Konstantinovich)
January 2010 -
Non-Uniform Reductions Article
Theory of Computing Systems, 47(2), 143-156.H.M. Buhrman (Harry), B. Hescott, S. Homer and L. Torenvliet (Leen)
August 2010