A low complexity user scheduling algorithm based on a novel adaptive Markov chain Monte Carlo (AMCMC) method is proposed to achieve the maximal sum capacity in an uplink multiple-i...
Yangyang Zhang, Chunlin Ji, Yi Liu, Wasim Q. Malik...
In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical one-way mode...
Wireless networks, and especially wireless sensor networks, have complexity and energy constraints, within which they must confront the challenging wireless fading environment. In ...
Andrew W. Eckford, Josephine P. K. Chu, Raviraj S....
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
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...