This study presents a novel technique to estimate the computational complexity of sequential decoding using the Berry-Esseen theorem. Unlike the theoretical bounds determined by the conventional central limit theorem argument, which often holds only for sufficiently large codeword length, the new bound obtained from the Berry-Esseen theorem is valid for any blocklength. The accuracy of the new ...

We prove upper and lower bounds on the e ective content and logical strength for a variety of natural restrictions of Hindman's Finite Sums Theorem. For example, we show that Hindman's Theorem for sums of length at most 2 and 4 colors implies ACA0. An emerging leitmotiv is that the known lower bounds for Hindman's Theorem and for its restriction to sums of at most 2 elements are already valid f...

The paper presents an improved collage theorem, valid for a class of signal mappings called Afine Blockwise Aueraging (ABA) Mappings. The .4BA structure is exploited to form a bound depending on norms of collage error signals at several resolutions. Compared to previously published collage theorems, the new theorem provides a much tighter bound on the maximum distance between the original signa...

This paper considers the Economic Lot Scheduling Problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. Combination of frequency and timing as well as production quantity make this problem Np-hard. A heuristic is developed to obtain a good solution to ELSP. The proposed heuristic makes use of the Simulated Annealing Technique...

In this paper, we intend to define and study concepts of weight and weighted spaces of holomorphic (analytic) functions on the upper half plane. We study two special classes of these spaces of holomorphic functions on the upper half plane. Firstly, we prove these spaces of holomorphic functions on the upper half plane endowed with weighted norm supremum are Banach spaces. Then, we investigate t...

We pursue a general theory of quantum games. In particular, we develop quantum generalizations of the two most important theorems from classical game theory: the Minimax Theorem and the Nash Equilibrium Theorem. We then show that quantum games are more efficient than classical games, and provide a saturated upper bound for this efficiency. [email protected] [email protected]

I extend a theorem of Bloch, which concerns the net orbital current carried by an interacting electron system in equilibrium, to include mesoscopic effects. I obtain a rigorous upper bound to the allowed ground-state current in a ring or disk, for an interacting electron system in the presence of static but otherwise arbitrary electric and magnetic fields. I also investigate the effects of spin...