Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 84
Number of items: 84
  • Open Access
    Ambainis, A., & de Wolf, R. (2013). How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions? In CCC 2013 : 2013 IEEE Conference on Computational Complexity: proceedings : 5-7 June 2013, Palo Alto, California, USA (pp. 179-184). IEEE. https://doi.org/10.1109/CCC.2013.26
  • 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
  • Open Access
    Ambainis, A., Bačkurs, A., Smotrovs, J., & de Wolf, R. (2013). Optimal quantum query bounds for almost all Boolean functions. In N. Portier, & T. Wilke (Eds.), 30th International Symposium on Theoretical Aspects of Computer Science: STACS '13, February 27th to March 2nd, 2013, Kiel, Germany (pp. 446-453). (Leibniz International Proceedings in Informatics; Vol. 20). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2013.446
  • Open Access
    Scarpa, G. (2013). Quantum entanglement in non-local games, graph parameters and zero-error information theory. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Open Access
    Klauck, H., & de Wolf, R. (2013). Fooling One-Sided Quantum Protocols. In N. Portier, & T. Wilke (Eds.), 30th International Symposium on Theoretical Aspects of Computer Science: STACS '13, February 27th to March 2nd, 2013, Kiel, Germany (pp. 424-433). (Leibniz International Proceedings in Informatics; Vol. 20). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2013.424
  • Fiorini, S., Massar, S., Pokutta, S., Tiwary, H. R., & de Wolf, R. (2012). Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. In STOC'12: 2012 ACM Symposium on Theory of Computing : May 19-22, 2012, New York, New York, USA (pp. 95-106). ACM. https://doi.org/10.1145/2213977.2213988
  • Open Access
    de Wolf, R. (2012). What quantum computing can do for you. (Inaugural lecture; No. 444). Vossiuspers UvA.
  • Open Access
    Ivanyos, G., Klauck, H., Lee, T., Santha, M., & de Wolf, R. (2012). New bounds on the classical and quantum communication complexity of some graph properties. In D. D'Souza, T. Kavitha, & J. Radhakrishnan (Eds.), IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS 2012, December 15-17, 2012 Hyderabad, India (pp. 148-159). (Leibniz International Proceedings in Informatics; Vol. 18). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.148
  • 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
  • Buhrman, H., Regev, O., Scarpa, G., & de Wolf, R. (2011). Near-Optimal and Explicit Bell Inequality Violations. In 26th IEEE Conference on Computational Complexity: proceedings : San Jose, California, 8-10 June 2011 (pp. 157-166). IEEE Computer Society. https://doi.org/10.1109/CCC.2011.30
Page 5 of 9