A Direct Product Theorem for the Two-Party Bounded-Round Public-Coin Communication Complexity

2012 ◽  
Author(s):  
Rahul Jain ◽  
Attila Pereszlenyi ◽  
Penghui Yao
Keyword(s):  
Direct Product ◽  
Communication Complexity ◽  
Product Theorem

A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity

Algorithmica ◽  
2015 ◽  
Vol 76 (3) ◽  
pp. 720-748 ◽  
Author(s):  
Rahul Jain ◽  
Attila Pereszlényi ◽  
Penghui Yao
Keyword(s):  
Direct Product ◽  
Communication Complexity ◽  
Product Theorem

The direct product theorem for profinite groups

2006 ◽  
Vol 9 (3) ◽  
Author(s):  
Daniel Goldstein ◽  
Robert M Guralnick
Keyword(s):  
Direct Product ◽  
Product Theorem ◽  
Profinite Groups
Sign in / Sign up

Export Citation Format

Share Document