TY - GEN
T1 - Probabilistic communication complexity of Boolean relations
AU - Raz, Ran
AU - Wigderson, Avi
PY - 1989
Y1 - 1989
N2 - The authors demonstrate an exponential gap between deterministic and probabilistic complexity and between the probabilistic complexity of monotonic and nonmonotonic relations. They then prove, as their main result, an Ω((log n)2) bound on the probabilistic communication complexity of monotonic st-connectivity. From this they deduce that every nonmonotonic NC1 circuit for st-connectivity requires a constant fraction of negated input variables.
AB - The authors demonstrate an exponential gap between deterministic and probabilistic complexity and between the probabilistic complexity of monotonic and nonmonotonic relations. They then prove, as their main result, an Ω((log n)2) bound on the probabilistic communication complexity of monotonic st-connectivity. From this they deduce that every nonmonotonic NC1 circuit for st-connectivity requires a constant fraction of negated input variables.
UR - http://www.scopus.com/inward/record.url?scp=0024771887&partnerID=8YFLogxK
U2 - 10.1109/sfcs.1989.63535
DO - 10.1109/sfcs.1989.63535
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0024771887
SN - 0818619821
SN - 9780818619823
T3 - Annual Symposium on Foundations of Computer Science (Proceedings)
SP - 562
EP - 567
BT - Annual Symposium on Foundations of Computer Science (Proceedings)
PB - Publ by IEEE
T2 - 30th Annual Symposium on Foundations of Computer Science
Y2 - 30 October 1989 through 1 November 1989
ER -