-
05-29
2007
Quantum communication complexity of block-composed functions
Speaker: Yaoyun Shi EECS, University of Michigan, Ann Arbor Time: 2007-05-29 14:00-2007-05-29 15:00 Venue: FIT Building 4-603, Tsinghua University Abstract: A central open problem in communication ...
-
05-15
2007
Describing vs. proving: connecting bounded arithmetic and descriptive complexity
Speaker: Antonina Kolokolova Simon Fraser University Time: 2007-05-15 15:00-2007-05-15 16:00 Venue: FIT Building 4-603, Tsinghua University Abstract: In this talk, we discuss and relate the framewo...
-
05-15
2007
Chernoff-type Direct Product Theorems
Speaker: Valentine Kabanets Simon Fraser University Time: 2007-05-15 14:00-2007-05-15 15:00 Venue: FIT Building 4-603, Tsinghua University Abstract: Consider a challenge-response protocol, where a ...
-
04-20
2007
co-B\"uchi Rankings and omega-Automata Transformations
Speaker: Qiqi Yan Shanghai Jiao Tong University Time: 2007-04-20 15:30-2007-04-20 16:30 Venue: FIT Building,Tsinghua University Abstract: Ranking-based constructions have been proposed for the comp...
-
03-29
2007
An Appropriate Design for Trusted Computingand Digital Rights Management
Speaker: Clark Thomborson The University of Auckland Time: 2007-03-29 15:30-2007-03-29 15:30 Venue: FIT Building,Tsinghua University Abstract: Trusted computing and digital rights management system...
-
03-28
2007
Two zero-knowledge interactive proofs for problems in graph theory with applicat
Speaker: Yvo Desmedt University College London Time: 2007-03-28 16:30-2007-03-28 17:30 Venue: FIT Building,Tsinghua University Abstract: Yvo Desmedt received his Ph.D. (Summa cum Laude) from the Un...