Kazan Federal University Digital Repository

Lower bounds for one-way probabilistic communication complexity and their application to space complexity

Show simple item record

dc.contributor.author Ablayev F.
dc.date.accessioned 2018-09-17T20:39:33Z
dc.date.available 2018-09-17T20:39:33Z
dc.date.issued 1996
dc.identifier.issn 0304-3975
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/133840
dc.description.abstract We prove three different types of complexity lower bounds for the one-way unbounded-error and bounded-error error probabilistic communication protocols for boolean functions. The lower bounds are proved in terms of the deterministic communication complexity of functions and in terms of the notion "probabilistic communication characteristic" that we define. We present boolean functions with the different probabilistic communication characteristics which demonstrates that each of these lower bounds can be more precise than the others depending on the probabilistic communication characteristics of a function. Our lower bounds are good enough for proving that proper hierarchy for one-way probabilistic communication complexity classes depends on a measure of bounded error. As the application of lower bounds for probabilistic communication complexity, we prove two different types of complexity lower bounds for the one-way bounded-error error probabilistic space complexity. Our lower bounds are good enough for proving proper hierarchies for different one-way probabilistic space communication complexity classes inside SPACE(n) (namely for bounded error probabilistic computation, and for errors of probabilistic computation).
dc.relation.ispartofseries Theoretical Computer Science
dc.title Lower bounds for one-way probabilistic communication complexity and their application to space complexity
dc.type Article
dc.relation.ispartofseries-issue 2
dc.relation.ispartofseries-volume 157
dc.collection Публикации сотрудников КФУ
dc.relation.startpage 139
dc.source.id SCOPUS03043975-1996-157-2-SID0030570116


Files in this item

This item appears in the following Collection(s)

  • Публикации сотрудников КФУ Scopus [24551]
    Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics