We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
The maximum likelihood estimate of the impulse response of a frequency-selective channel in the presence of phase noise and I/Q imbalance is derived. The complexity of the joint es...
Abstract. New emerging applications including genomic, multimedia, and geospatial technologies have necessitated the handling of complex application objects that are highly structu...
Tao Chen, Arif Khan, Markus Schneider, Ganesh Visw...
In this primarily expository article, I describe geometric approaches to variants of P v. NP, present several results that illustrate the role of group actions in complexity theory...
Abstract. The highway pricing problem asks for prices to be determined for segments of a single highway such as to maximize the revenue obtainable from a given set of customers wit...