Results 31 to 40 of about 17,450 (322)
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
On the Multiplicative Complexity of Cubic Boolean Functions [PDF]
, 2021 Multiplicative complexity is a relevant complexity measure for many advanced cryptographic protocols such as multi-party computation, fully homomorphic encryption, and zero-knowledge proofs, where processing AND gates is more expensive than processing ...
Meltem Sonmez Turan, Rene Peralta
core
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
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
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
Invertible Quadratic Non-Linear Layers for MPC-/FHE-/ZK-Friendly Schemes over Fnp
IACR Transactions on Symmetric Cryptology, 2022 Motivated by new applications such as secure Multi-Party Computation (MPC), Fully Homomorphic Encryption (FHE), and Zero-Knowledge proofs (ZK), many MPC-, FHE- and ZK-friendly symmetric-key primitives that minimize the number of multiplications over Fp ...
Lorenzo Grassi +3 more
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
Supercongruences and complex multiplication
Journal of Number Theory, 2016 19 ...
Kibelbek, Jonas +4 more
openaire +2 more sources
Reducing the Multiplicative Complexity in Logic Networks for Cryptography and Security Applications
Design Automation Conference, 2019 Reducing the number of AND gates plays a central role in many cryptography and security applications. We propose a logic synthesis algorithm and tool to minimize the number of AND gates in a logic network composed of AND, XOR, and inverter gates.
Eleonora Testa +3 more
semanticscholar +1 more source
Вестник Самарского государственного технического университета. Серия: Технические науки, 2023 The article discusses the methodology and design template for a complex of structurally, functionally, informationally and metrologically compatible software modules that implement algorithms for calculating estimates of the PSD power spectral density ...
Andrey V. Mashkov
doaj +1 more source