Yahoo Search Busca da Web

Resultado da Busca

  1. en.wikipedia.org › wiki › Andrew_YaoAndrew Yao - Wikipedia

    Andrew Chi-Chih Yao (Chinese: 姚期智; pinyin: Yáo Qīzhì; born December 24, 1946) is a Chinese computer scientist and computational theorist. He is currently a professor and the dean of Institute for Interdisciplinary Information Sciences (IIIS) at Tsinghua University. Yao used the minimax theorem to prove what is now known as ...

  2. 78. "Quantum Circuit Complexity", Andrew Chi-Chih Yao, Proceedings of Thirty-fourth IEEE Symposium on Foundations of Computer Science (FOCS1993), Palo Alto, California, November 1993, 352-361. 79. "A Randomized Algorithm for Maximum Finding with Parity Tests", Hing F. Ting and Andrew C. Yao, Information Processing Letters, 49 (1994), 39-43. 80.

  3. CITATION. In recognition of his fundamental contributions to the theory of computation, including the complexity-based theory of pseudorandom number generation, cryptography, and communication complexity. Short Annotated. Bibliography. Research. Subjects. Andrew Chi-Chih Yao was born in Shanghai, China, on December 24, 1946.

  4. Andrew Yao (em chinês: Yao Chi-Chih, 姚期智, Yáo Qīzhì) (Xangai, 24 de dezembro de 1946) é um informático chinês. Foi agraciado com o Prêmio Turing de 2000, por suas pesquisas sobre teoria da computação, em especial a Complexidade computacional. Graduado em física pela Universidade Nacional de Taiwan.

  5. Andrew Chi-Chih Yao created new trends in computer science and made a great contribution to cutting-edge research in various areas, especially in security, secure computing, and quantum computation through establishing innovative fundamental theories for computation and communication.

  6. Andrew Chi-Chih Yao: On Solutions for the Maximum Revenue Multi-item Auction under Dominant-Strategy and Bayesian Implementations. CoRR abs/1607.03685 (2016)

  7. 1 de mai. de 2024 · Andrew Chi-Chih Yao is a Chinese American computer scientist and winner of the 2000 A.M. Turing Award, the highest honour in computer science, for his “fundamental contributions to the theory of computation [computational complexity], including the complexity-based theory of pseudorandom number.