Results 11 to 20 of about 16,145 (263)
Nonbinary polar coding with low decoding latency and complexity
Journal of Information and Intelligence, 2023 In this paper, we propose a new class of nonbinary polar codes, where the symbol-level polarization is achieved by using a 2 × 2 q-ary matrix 10β1 as the kernel.
Peiyao Chen, Baoming Bai, Xiao Ma
doaj +1 more source
Additive-error fine-grained quantum supremacy [PDF]
Quantum, 2020 It is known that several sub-universal quantum computing models, such as the IQP model, the Boson sampling model, the one-clean qubit model, and the random circuit model, cannot be classically simulated in polynomial time under certain conjectures in ...
Tomoyuki Morimae, Suguru Tamaki
doaj +1 more source
Direct multiplicative methods for sparse matrices. Linear programming [PDF]
Компьютерные исследования и моделирование, 2017 Multiplicative methods for sparse matrices are best suited to reduce the complexity of operations solving systems of linear equations performed on each iteration of the simplex method.
Anastasiya Borisovna Sviridenko
doaj +1 more source
Multiplications on a Complex [PDF]
The Annals of Mathematics, 1936 In their communications at the First International Topological Conference (Moscow, September 1935), J. W. Alexander and A. Kolmogoroff introduced the notion of a dual cycle1 and defined a product of a dual p-eycle and a dual q-eycle, this product being a dual (p + q)-eyele. A different multiplication of the same sort is considered in this paper. It may
openaire +1 more source
On the Complexity of Multiple Sequence Alignment [PDF]
Journal of Computational Biology, 1994 We study the computational complexity of two popular problems in multiple sequence alignment: multiple alignment with SP-score and multiple tree alignment. It is shown that the first problem is NP-complete and the second is MAX SNP-hard. The complexity of tree alignment with a given phylogeny is also considered.
Lusheng Wang 0001, Tao Jiang 0001
openaire +2 more sources
The complexity of iterated multiplication
[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Immerman, N, LANDAU, S
openaire +4 more sources
Complexity and multiple complexes
Mathematische Zeitschrift, 1987 Let G be a finite group and let R be a commutative ring with unit. One of the most basic problems in group cohomology is that of finding suitable projective resolutions for RG-modules. The main result of this paper shows that if \(R=k\) is a field of characteristic \(p>0\), and if M is any finitely generated kG-module then there exists a projective ...
Carlson, Jon F., Benson, David J.
openaire +1 more source
Black Holes and Complexity via Constructible Universe
Universe, 2020 The relation of randomness and classical algorithmic computational complexity is a vast and deep subject by itself. However, already, 1-randomness sequences call for quantum mechanics in their realization.
Jerzy Król, Paweł Klimasara
doaj +1 more source
Efficient Algorithms for Coded Multicasting in Heterogeneous Caching Networks
Entropy, 2019 Coded multicasting has been shown to be a promising approach to significantly improve the performance of content delivery networks with multiple caches downstream of a common multicast link.
Giuseppe Vettigli +5 more
doaj +1 more source
One-Sided Sequent Systems for Nonassociative Bilinear Logic: Cut Elimination and Complexity
Bulletin of the Section of Logic, 2021 Bilinear Logic of Lambek amounts to Noncommutative MALL of Abrusci. Lambek proves the cut–elimination theorem for a one-sided (in fact, left-sided) sequent system for this logic.
Paweł Płaczek
doaj +1 more source