Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 8
Number of items: 8
  • Cleve, R., Slofstra, W., Unger, F., & Upadhyay, S. (2008). Perfect parallel repetition theorem for quantum XOR proof systems. Computational Complexity, 17(2), 282-299. https://doi.org/10.1007/s00037-008-0250-4
  • Unger, F. (2008). Noise threshold for universality of two-input gates. IEEE Transactions on Information Theory, 54(8), 3693-3698. https://doi.org/10.1109/TIT.2008.926459
  • Open Access
    Unger, F. P. (2008). Noise in quantum and classical computation & non-locality. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Unger, F. P. (2006). On Small Hard Leaf Languages. In 30th International Symposium on Mathematical Foundations of Computer Science (pp. 781-792)
  • Brassard, G., Buhrman, H. M., Linden, N., Méthot, A. A., Tap, A., & Unger, F. P. (2006). Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial. Physical Review Letters, 96, 250401. http://prl.aps.org/
  • Buhrman, H. M., 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.
  • Buhrman, H. M., Cleve, R., Laurent, M., Linden, N., Schrijver, A., & Unger, F. P. (2006). New limits on fault-tolerant quantum computation. In 47th Annual IEEE Symposium on Foundations of Computer Science (pp. 411-419)
  • Buhrman, H. M., Christandl, M., Unger, F. P., Wehner, S. D. C., & WInter, A. (2006). Implications of superstrong non-locality for cryptography. In Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Vol. 462, pp. 1919-1932)
Page of