14 search results - page 2 / 3 » A Separation of NP and coNP in Multiparty Communication Comp... |
TOC
2010
13 years 1 days ago
2010
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We obtain a lower bound of n 1 k+1 22k (k-1)2k-1 on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of mul...
COCO
2009
Springer
13 years 12 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
STOC
2007
ACM
14 years 5 months ago
2007
ACM
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
JCIT
2010
13 years 4 days ago
2010
In 2008, Wang et. al. first investigate a sort of specific secure multi-party computation--secure convex hull two-party computation, and construct two protocols based on Gift wrap...