Results 1 to 10 of about 77,530 (97)
Enabling computation of correlation bounds for finite-dimensional quantum systems via symmetrisation
We present a technique for reducing the computational requirements by several orders of magnitude in the evaluation of semidefinite relaxations for bounding the set of quantum correlations arising from finite-dimensional Hilbert spaces.
Renou, Marc-Olivier +2 more
core +2 more sources
Trivalent Graph isomorphism in polynomial time [PDF]
It's important to design polynomial time algorithms to test if two graphs are isomorphic at least for some special classes of graphs. An approach to this was presented by Eugene M. Luks(1981) in the work \textit{Isomorphism of Graphs of Bounded Valence
Mena, Adria Alcala
core +2 more sources
Traditional compressed sensing considers sampling a 1D signal. For a multidimensional signal, if reshaped into a vector, the required size of the sensing matrix becomes dramatically large, which increases the storage and computational complexity ...
Fang, Hao +3 more
core +1 more source
On the Cartan matrix of Mackey algebras [PDF]
Let k be a field of characteristic p>0, and G be a finite group. The first result of this paper is an explicit formula for the determinant of the Cartan matrix of the Mackey algebra mu_k(G) of G over k.
Bouc, Serge
core +1 more source
Spindle configurations of skew lines
We prove a conjecture of Crapo and Penne which characterizes isotopy classes of skew configurations with spindle-structure. We use this result in order to define an invariant, spindle-genus, for spindle-configurations.
Borobia +11 more
core +2 more sources
Algebraic properties of generalized Rijndael-like ciphers [PDF]
We provide conditions under which the set of Rijndael functions considered as permutations of the state space and based on operations of the finite field $\GF (p^k)$ ($p\geq 2$ a prime number) is not closed under functional composition.
B. Scott +5 more
core
On duality inducing automorphisms and sources of simple modules in classical groups [PDF]
Bonnafé C. +2 more
core +2 more sources
A New Lower Bound for Noisy Permutation Channels via Divergence Packing. [PDF]
Feng L, Lv G, Li X, Jin Y.
europepmc +1 more source
Accurate and efficient P-values for rank-based independence tests with clustered data using a saddlepoint approximation. [PDF]
Newer HA.
europepmc +1 more source
RGB image encryption using SPN with a novel block cipher over simple graph adjacency matrices and Galois fields. [PDF]
Sajjad M, Alqwaifly NA.
europepmc +1 more source

