We give a simple proof characterizing the complexity of Pres-burger arithmetic augmented with additional predicates. We show that Pres-burger arithmetic with additional predicates is 1 1 complete. Adding one unary predicate is enough to get 1 1 hardness, while adding more predicates (of any arity) does not make the complexity any worse.

‎we obtain the asymptotic expansion of the sequence with general term $frac{a_n}{g_n}$‎, ‎where $a_n$ and $g_n$ are the arithmetic and geometric means of the numbers $d(1),d(2),dots,d(n)$‎, ‎with $d(n)$ denoting the number of positive divisors of $n$‎. ‎also‎, ‎we obtain some explicit bounds concerning $g_n$ and $frac{a_n}{g_n}$.

Quantum computer requires quantum arithmetic. The sophisticated design of a reversible arithmetic logic unit (reversible ALU) for quantum arithmetic has been investigated in this letter. We provide explicit construction of reversible ALU effecting basic arithmetic operations. By provided the corresponding control unit, the proposed reversible ALU can combine the classical arithmetic and logic o...

In this paper, we investigate the multiple attribute decision making (MADM) problem based on the arithmetic and geometric aggregation operators with hesitant fuzzy linguistic information. Then, motivated by the idea of traditional arithmetic operation, we have developed some aggregation operators for aggregating hesitant fuzzy linguistic information: hesitant fuzzy linguistic weighted average (...

This paper presents arithmetic operations like addition, subtraction and multiplications in Modulo-4 arithmetic, and also addition, multiplication in Galois field, using multi-valued logic (MVL). Quaternary to binary and binary to quaternary converters are designed using down literal circuits. Negation in modular arithmetic is designed with only one gate. Logic design of each operation is achie...

let $f$ be a finite extension of $bbb q$‎, ‎${bbb q}_p$ or a global‎ ‎field of positive characteristic‎, ‎and let $e/f$ be a galois extension‎. ‎we study the realization fields of‎ ‎finite subgroups $g$ of $gl_n(e)$ stable under the natural‎ ‎operation of the galois group of $e/f$‎. ‎though for sufficiently large $n$ and a fixed‎ algebraic number field $f$ every its finite extension $e$ is‎ ‎re...

Spiking neural P system with chain structure (SNPC, for short) is a new membrane system, which combines spiking neural P system (SNP, for short) with discrete Morse theory, that is to say, neural membrane cells in spiking neural P system are set on chain by discrete gradient vector path, building a SNP system with chain structure. Membrane computing is a computational model, which simulates the...

As a public key cryptography, Elliptic Curve Cryptography (ECC) is well known to be the most secure algorithms that can be used to protect information during the transmission. ECC in its arithmetic computations suffers from modular inversion operation. Modular Inversion is a main arithmetic and very long-time operation that performed by the ECC crypto-processor. The use of projective coordinate...