Phan Dinh Dieu, On a Necessary Condition for Stochastic Languages,Elektronische Informationsverarbeitung und Kybernetik, 8 (1972), 575-588. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Lower Bounds for One-way Probabilistic Communication Complexity.. - Ablayev (1996) (9 citations) (Correct)
.... metric lower bound (theorem 4) 2) For unbounded error computation geometric lower bound (theorem 5) We use different methods for proving these lower bounds: the entropy method [1] for the theorem 1, the Rabin s [25] metric method for the theorem 4, and the Phan Dinh Dieu geometric method [8] for the theorem 5. We define the notion of probabilistic communication characteristic of boolean functions. This characteristic players an important role in the entropic lower bound. We present boolean functions which demonstrates that each of our three lower bounds can be more precise than the ....
Phan Dinh Dieu, On a Necessary Condition for Stochastic Languages,Elektronische Informationsverarbeitung und Kybernetik, 8 (1972), 575-588.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC