Abstract As introduced in the previous chapters, complexity of hypergraph computation is relatively high. In practical applications, may not be a small scale, where we often encounter scenario that size very large. Therefore, confronts issues many applications. how to handle large scale data an important task. this chapter, discuss methods for hypergraphs and their Two types are provided data, ...

In this article we continue to develop the theory of generating symmetries for integrable equations. A technique computation using Maple is presented. The based on standard symmetry method. By it find KdV, Camassa–Holm, mKdV, sine-Gordon, Boussinesq, associated Degasperis-Procesi and Novikov

This paper presents a new software framework for solving large and sparse linear systems on current hybrid architectures, from small servers to high-end supercomputers, embedding multi-core CPUs Nvidia GPUs at the node level. The has modular structure is composed of three main components, which separate basic functionalities managing distributed matrices executing some matrix computations invol...

The Special Issue on “Computation in Complex Networks” focused gathering highly original papers the field of current complex network research [...]

In the standard oracle model, an efficiently evaluates unknown classical function independent of quantum algorithm itself. Quantum algorithms have a complex interrelationship to their oracles; for example possibility speedup is affected by manner which oracles are implemented. Therefore, it physically meaningful separate from algorithms, and we introduce one such separation here. We define Blin...