4. Computer Science
  5. Computational Complexity

Penghui Yao

Computer Science – Computational Complexity

Scientist

Rate now
  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientist

A direct product theorem for bounded-round public-coin randomized communication complexity

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A parallel approximation algorithm for mixed packing and covering semidefinite programs

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Parallel Approximation Algorithm for Positive Semidefinite Programming

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Adversary lower bounds for nonadaptive quantum algorithms

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Penghui Yao does not yet have a rating. At this time, there are no reviews or comments for this scientist.

If you have personal experience with Penghui Yao, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Penghui Yao will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-P-233430

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.

Canada

 Charities
 Companies
 MP Candidates
 Patents
 Employee Salary Disclosure

World

 Places of the World
 Scientific Papers

United States

 Banks
 Companies
 Counties
 Patents
 Employee Salary Disclosure