uva.nl

Institute for Logic, Language and Computation

Searchable List of Research Output

Filter Publications
  • Buhrman, H., Regev, O., Scarpa, G., de Wolf, R. (2012) Near-Optimal and Explicit Bell Inequality Violations.
    Theory of Computing, Vol. 8 (pp 623-645)
  • Buhrman, H., Röhrig, H.P. (2003) Distributed quantum computing.
    In Proceedings of Mathematical Foundations of Computer Science (pp 1-20) (Lecture Notes in Computer Science, Vol. 2747). Springer.
    Conference contribution | UvA-DARE
  • Buhrman, H., Spalek, R. (2006) Quantum Verification of Matrix Products.
    In Proceedings of 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'06) (pp 880-889). ACM Press.
    Conference contribution | UvA-DARE
  • Buhrman, H., Thierauf, T. (1996) The complexity of generating and checking proofs of membership.
    In proc STACS'96 (pp 75-86) (LNCS). Springer.
    Chapter | UvA-DARE
  • Buhrman, H., Torenvliet, L., Unger, F.P. (2006) Spare Self-reducible sets and polynomial size circuit lower bounds.
    In Proceedings of STACS 2006 (pp 455-468). Springer.
    Conference contribution | UvA-DARE
  • Buhrman, H., Torenvliet, L., Unger, Falk, Vereshchagin, N. (2019) Sparse Selfreducible Sets and Nonuniform Lower Bounds.
    Algorithmica, Vol. 81 (pp 179-200)
  • Buhrman, H., Torenvliet, L., Unger, Falk (2006) Sparse selfreducible sets and polynomial size circuit lower bounds.
    In STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science, Proceedings (pp 455-468) (Lecture Notes in Computer Science, Vol. 3884). Springer.
    Conference contribution | https://doi.org/10.1007/11672142_37 | UvA-DARE
  • Buhrman, H., Torenvliet, L. (1994) On the cutting edge of relativization: The resource bounded injury method.
    In Shamir, E. Abiteboul, S. (Eds.), Proc. ICALP 94 (pp 263-273) (Lecture Notes in Computer Science). Springer Verlag.
    Chapter | UvA-DARE
  • Buhrman, H., Torenvliet, L. (1994) On the structure of complete sets.
    In Schoening, U. (Eds.), Proc. Structure in Complexity Theory, 9th annual conference (pp 118-133). IEEE Computer Society Press.
    Chapter | UvA-DARE
  • Buhrman, H., Torenvliet, L. (1996) Complete sets and structure in sub-recursive classes.
    In Logic Colloquium 96: European Summer Meeting of the Association for Symbolic Logic (pp 59-64)
    Chapter | UvA-DARE
  • Buhrman, H., Torenvliet, L. (1996) P-selective self-reducible sets: A new characterization of P.
    Journal of Computer and System Sciences, Vol. 53 (pp 210-217)
  • Buhrman, H., Torenvliet, L. (1998) Complete sets and structure in subrecursive classes.
    Lecture Notes in Logic, Vol. 12 (pp 45-78)
    Article | UvA-DARE
  • Buhrman, H., Torenvliet, L. (1998) Complete sets and structure in subrecursive classes.
    In Proceedings of the logic colloquium '96 (pp 45-78) (-)
    Chapter | UvA-DARE
  • Buhrman, H., Torenvliet, L. (1998) Randomness is hard.
    In Proceedings of the 15th symposium on theoretial aspects of computation science (pp 249-260) (-). Springer-Verlag.
    Chapter | UvA-DARE
  • Buhrman, H., Torenvliet, L. (1998) Randomness is hard.
    In Proceedings of the 1998 conference on computational complexity (pp 249-260) (-). IEEE Computing society press.
    Chapter | UvA-DARE
  • Buhrman, H., Torenvliet, L. (1999) Complicated complementations.
    In Proceedings 14th IEEE Conference on Computational Complexity (pp 227-236). IEEE Computer Society Press.
    Conference contribution | UvA-DARE
  • Buhrman, H., Torenvliet, L. (2000) Randomness is Hard.
    SIAM Journal on Computing, Vol. 30 (pp 1485-1501)
  • Buhrman, H., Torenvliet, L. (2004) Separating complexity classes using structural properties.
    In Proceedings 19th Conference on Computational Complexity (pp 130). IEEE Computer Society Press.
    Conference contribution | UvA-DARE
  • Buhrman, H., Torenvliet, L. (2005) A Post's program for complexity theory.
    Bulletin of the European Association for Theoretical Computer Science, Vol. 85 (pp 41-51)
    Article | UvA-DARE
  • Buhrman, H., Tromp, J.A.H., Vitányi, P.M.B. (2001) Time and space bounds for reversible simulation.
    Journal of Physics. A, Mathematical and General, Vol. 34 (pp 6821-6830)
1 ... 63 64 65 66 67 68 69 70 71 ... 308

The data of this list is taken from the Pure database. If you find output is missing from the list, please follow the previous link to find out how to submit to Pure. In case there are mistakes in PURE, please contact