This paper is concerned with the complexity of some natural subclasses of minimal unsatisfiable formulas. We show the DP –completeness of the classes of maximal and marginal mi...
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...
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed ...
Complex symmetric matrices whose real and imaginary parts are positive definite are shown to have a growth factor bounded by 2 for LU factorization. This result adds to the classe...