Communication complexity is the amount of communication needed to compute a function when inputs are distributed over multiple parties. In its simplest form, one-way complexity, Alice and Bob f(x,y)</mml:...

In 1989, Babai, Nisan and Szegedy [BNS92] gave a construction of a pseudorandom generator for logspace, based on lower bounds for multiparty communication complexity. The seed length of their pseudorandom generator was 2 √ , because the best lower bounds for multiparty communication complexity are relatively weak. Subsequently, pseudorandom generators for logspace with seed length O(log n) were...

A compact unbalanced two-way filtering power splitter with an integrated Chebyshev function is presented. The design purely based on formulations, thereby eliminating the constant need for developing complex optimization algorithms and tuning, to deliver desired amount of at each two output ports. To achieve miniaturization, a common square open-loop resonator (SOLR) used distribute energy betw...