# Information Processing Letters

Information Processing Letters > 2004 > 89 > 1 > 37-42

Information Processing Letters > 2004 > 89 > 1 > 49-52

_{2}((n-1)/(h-1))) bits. The access time per node is in O(1). The scheme uses a cumulative-count technique to map the nodes at each level in the tree into sequential memory locations...

Information Processing Letters > 2004 > 89 > 1 > 25-29

Information Processing Letters > 2004 > 89 > 1 > 19-23

^{2}

^{k}

^{-}

^{1}) time bound for any integer constant...

Information Processing Letters > 2004 > 89 > 1 > 15-18

Information Processing Letters > 2004 > 89 > 1 > 31-35

^{n}->R

^{n}as input and ask, for example, whether this function is mortal, nilpotent, terminating, or reaches a fixed point on a given point in R

^{n}. We associate topologies...

Information Processing Letters > 2004 > 89 > 1 > 43-47

_{e}

_{x}

_{p}(NP coNP)/poly, where AM

_{e}

_{x}

_{p}denotes the exponential version of the class AM. Since there are oracles relative to which AM

_{e}

_{x}

_{p}P/poly, our result is an instance of very few nonrelativizable separation results.

Information Processing Letters > 2004 > 89 > 1 > 9-14

Information Processing Letters > 2004 > 89 > 2 > 91-98

_{1},p

_{2},...,p

_{n}} be a set of point sites distributed on a 2D map. A label associated with each point p

_{i}is an axis-parallel rectangle r

_{i}of specified width. The height of all r

_{i},i=1,2,...,n are same. The placement of r

_{i}must contain p

_{i}at its top-left or bottom-left corner,...

Information Processing Letters > 2004 > 89 > 2 > 65-70

Information Processing Letters > 2004 > 89 > 2 > 53-56

Information Processing Letters > 2004 > 89 > 2 > 57-63

Information Processing Letters > 2004 > 89 > 2 > 85-90

Information Processing Letters > 2004 > 89 > 2 > 99-103

Information Processing Letters > 2004 > 89 > 2 > 71-74

_{n}:{0,1}

^{n}->{0,1}

^{m}(m=<n) can be computed by Boolean circuits with polynomial (in n) number of And, Or and Not gates, but every such circuit must use at least logn-O(loglogn) Not gates. This is almost optimal because results of Markov [J. ACM 5 (1958) 331] and Fisher [Lecture Notes in Comput. Sci., Vol. 33, Springer,...

Information Processing Letters > 2004 > 89 > 3 > 131-135