News
Lower-bound results on Boolean-function complexity under two different models are discussed. The first is an abstraction of tradeoffs between chip area and speed in very-large-scale-integrated (VLSI) ...
It is known that the Lerch (or periodic) zeta function of nonpositive integer order, l _n (ξ), n Є No := {0,1,2,3,...}, is a polynomial in cot (πξ) of degree n+1. In this paper, a very simple explicit ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results