Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 173
Number of items: 173
  • Brody, J., Buhrman, H., Koucký, M., Loff, B., Speelman, F., & Vereshchagin, N. (2013). Towards a reverse Newman's theorem in interactive information complexity. In CCC 2013 : 2013 IEEE Conference on Computational Complexity: proceedings : 5-7 June 2013, Palo Alto, California, USA (pp. 24-33). IEEE. https://doi.org/10.1109/CCC.2013.12
  • Buhrman, H., Fortnow, L., Hitchcock, J. M., & Loff, B. (2013). Learning reductions to sparse sets. In K. Chatterjee, & J. Sgall (Eds.), Mathematical Foundations of Computer Science 2013: 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013 : proceedings (pp. 243-253). (Lecture Notes in Computer Science; Vol. 8087). Springer. https://doi.org/10.1007/978-3-642-40313-2_23
  • Open Access
    Briët, J., Buhrman, H., Lee, T., & Vidick, T. (2013). Multipartite entanglement in XOR games. Quantum Information & Computation, 13(3&4), 334-360. https://doi.org/10.26421/QIC13.3-4
  • Open Access
    Buhrman, H., García-Soriano, D., Matsliah, A., & de Wolf, R. (2013). The non-adaptive query complexity of testing k-parities. Chicago Journal of Theoretical Computer Science, 2013, Article 6. https://doi.org/10.4086/cjtcs.2013.006
  • Briët, J., Buhrman, H., Lee, T., & Vidick, T. (2012). All Schatten spaces endowed with the Schur product are Q-algebras. Journal of Functional Analysis, 262(1), 1-9. https://doi.org/10.1016/j.jfa.2011.09.001
  • Allender, E., Buhrman, H., Friedman, L., & Loff, B. (2012). Reductions to the set of random strings: The resource-bounded case. In B. Rovan, V. Sassone, & P. Widmayer (Eds.), Mathematical Foundations of Computer Science 2012: 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012 : proceedings (pp. 88-99). (Lecture Notes in Computer Science; Vol. 7464). Springer. https://doi.org/10.1007/978-3-642-32589-2_11
  • Open Access
    Buhrman, H., Christandl, M., & Schaffner, C. (2012). Complete insecurity of quantum protocols for classical two-party computation. Physical Review Letters, 109(16), 160501. https://doi.org/10.1103/PhysRevLett.109.160501
  • Open Access
    Branciard, C., Brunner, N., Buhrman, H., Cleve, R., Gisin, N., Portmann, S., Rosset, D., & Szegedy, M. (2012). Classical simulation of entanglement swapping with bounded communication. Physical Review Letters, 109(10), Article 100401. https://doi.org/10.1103/PhysRevLett.109.100401
  • Open Access
    García Soriano, D. (2012). Query-efficient computation in property testing and learning theory. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Open Access
    Buhrman, H., Regev, O., Scarpa, G., & de Wolf, R. (2012). Near-Optimal and Explicit Bell Inequality Violations. Theory of Computing, 8, 623-645. Article 27. https://doi.org/10.4086/toc.2012.v008a027
Page 6 of 18