Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
back to result list
  • 1
    Electronic Resource
    Electronic Resource
    Fourier analysis for probabilistic communication complexity (1995)
    Springer
    Computational complexity 5 (1995), S. 205-221 
    Details
    ISSN: 1420-8954
    Keywords: Lower-bound ; complexity ; Fourier analysis ; 68Q25 ; 68Q99
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We use Fourier analysis to get general lower bounds for the probabilistic communication complexity of large classes of functions. We give some examples showing how to use our method in some known cases and for some new functions. Our main tool is an inequality by Kahn, Kalai, and Linial, derived from two lemmas of Beckner.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01206318
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...