The term metric or distance of a graph plays a vital role in the study to check the structural properties of the networks such as complexity, modularity, centrality, accessibility, connectivity, robustness, clustering, and vulnerability.
Shahbaz Ali +3 more
doaj +1 more source
Permuting operations on strings and the distribution of their prime numbers [PDF]
Several ways of interleaving, as studied in theoretical computer science, and some subjects from mathematics can be modeled by length-preserving operations on strings, that only permute the symbol positions in strings. Each such operation X gives rise to
Asveld, Peter R.J.
core +7 more sources
Novel Architecture for Efficient Implementation of Modular Exponentiation Algorithm [PDF]
One of the most difficult problems in web research is security. Cryptography is the fundamental technique utilized in secure communication. One key element of cryptography is Public-Key Cryptography (PKC).
Abdalhossein Rezai
doaj +1 more source
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer [PDF]
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor.
Karatsuba A. +4 more
core +5 more sources
A generalisation of two partition theorems of Andrews [PDF]
In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which generalise Schur’s celebrated partition identity (1926). Andrews’ two generalisations of Schur’s theorem went on to become two of the most influential results in ...
Jehanne Dousse
doaj +1 more source
Fully Homomorphic Encryption Scheme for Securing Cloud Data
One of the pioneer and important fields in the computer science area is cloud computing. The data within cloud computing are usually transformed to it from local storage; therefore, the security of this data is an important issue.
Tara Al Attar, Mohammed Anwar MOHAMMED
doaj +1 more source
Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey
Integer Linear Programming (ILP) is among the most successful and general paradigms for solving computationally intractable optimization problems in computer science.
Robert Ganian, Sebastian Ordyniak
doaj +1 more source
Mathematics and Computer Science :Proceedings of Annual Workshop on Mathematics and Computer Science, March 25, 2014, JOSAI UNIVERSITY [PDF]
In the research area of physical random number generation, a kind of “post-process” function to improve the randomness of the generated bit sequence has been studied. There a two-dimensional integer sequence indexed by the input and the output lengths of
縫田, 光司
core +1 more source
Teaching Students to Use the Gauss Method for Integer Matrices when Implemented on a Computer
The paper is written on the basis of a part of “Analysis of algorithms” course for students of the Computer science department of the Division of mathematics and mechanics of Saint Petersburg State University.
T. Kosovskaya
semanticscholar +1 more source
Parallel Integer Sort: Theory and Practice [PDF]
Integer sorting is a fundamental problem in computer science. This paper studies parallel integer sort both in theory and in practice. In theory, we show tighter bounds for a class of existing practical integer sort algorithms, which provides a solid ...
Xiaojun Dong +3 more
semanticscholar +1 more source

