-
1
-
2
Algorithmic complexity of linear nonassociative algebra
Published 2020-09-01Subjects: “…algebra complexity…”
Get full text
Article -
3
-
4
Efficient and Private Computations with Code-Based Masking
Published 2020-03-01“…Nevertheless, this higher algebraic complexity also implies additional challenges. …”
Get full text
Article -
5
Iterated lower bound formulas: a diagonalization-based approach to lower bounds in proof complexity
Published 2021“…This is the first equivalence between proof complexity lower bounds and standard algebraic complexity lower bounds. Our proof of this fact uses the implication from IPS lower bounds to algebraic complexity lower bounds due to Grochow and Pitassi [GP18] together with a diagonalization argument: the formulas φ_n themselves assert the non-existence of short IPS proofs for formulas encoding VNP ≠ VP at a different input length. …”
Conference item -
6
On the analytical approximation of the quadratic non-linear oscillator by modified extended iteration method
Published 2020-06-01“…The percentage of error between the exact frequency and our third approximate frequency is as low as 0.001%. There is no algebraic complexity in our calculation, which is why this technique is very easy. …”
Get full text
Article -
7
Analytical technique for solving the quadratic nonlinear oscillator
Published 2020-09-01“…In this article, a simple form of harmonic balance solution is obtained where algebraic complexity is partially reduced and all the related nonlinear algebraic equations are solved analytically.…”
Get full text
Article -
8
A mathematical model for the interplay of Nosema infection and forager losses in honey bee colonies
Published 2017-08-01“…The model is non-autonomous with periodic coefficient functions. Algebraic complexity prevents a rigorous mathematical analysis. …”
Get full text
Article -
9
The arithmetic codex
Published 2013“…It encompasses several well-established notions from cryptography (arithmetic secret sharing schemes, which enjoy additive as well as multiplicative properties) and algebraic complexity theory (bilinear complexity of multiplication) in a natural mathematical framework. …”
Get full text
Get full text
Conference Paper -
10
Enumerating Discrete Resonant Rossby/Drift Wave Triads and Their Application in Information Security
Published 2022-11-01“…Via extensive analyses over several indicators (nonlinearity, algebraic complexity, linear and differential approximation probabilities, strict avalanche criteria, and bit independence criterion) we show that the newly developed S-box outperforms the S-boxes constructed by most of the existing schemes.…”
Get full text
Article -
11
The effect of strong shear on internal solitary-like waves
Published 2021-10-01“…The Dubreil–Jacotin–Long, or DJL, theory of exact internal solitary waves can account for a background shear, doing so at the cost of algebraic complexity and a lack of a mathematical proof of algorithm convergence. …”
Get full text
Article -
12
Improved SERPENT Algorithm: Design to RGB Image Encryption Implementation
Published 2020-01-01“…The multiplicative substructures in a chain ring have multiple generators and thus the chain ring based S-boxes improve the algebraic complexity of the cipher. Apart from it, the algorithm is utilized in a digital RGB image encryption application where throughout the chain ring operations are performed. …”
Get full text
Article -
13
Algebraic methods for chemical reaction networks with extrinsic noise
Published 2019“…In particular, these methods allow for parameter-free model rejection, or model testing and give upper bounds on the algebraic complexity of these tasks. Further, a parameter-free result on the capability of multistationarity in infinite classes of networks is proved.…”
Thesis -
14
Improved Twofish Algorithm: A Digital Image Enciphering Application
Published 2021-01-01“…As these S-boxes have the property of having copious generators, they, therefore, produce a rich algebraic complexity. Moreover, the time complexity of the proposed work is modified by processing the 64-bit block throughout the process and reducing the number of subkeys. …”
Get full text
Article -
15
Low-Complexity Cryptographic Hash Functions
Published 2021“…Despite the ubiquitous role of hash functions in cryptography, several of the most basic questions regarding their computational and algebraic complexity remained open. In this work we settle most of these questions under new, but arguably quite conservative, cryptographic assumptions, whose study may be of independent interest. …”
Get full text
Article -
16
Mathematics for Computer Graphics /
Published [202“…The first five chapters cover a general introduction, number sets, algebra, trigonometry and coordinate systems, which are employed in the following chapters on determinants, vectors, matrix algebra, complex numbers, geometric transforms, quaternion algebra, quaternions in space, interpolation, curves and patches, analytical geometry and barycentric coordinates. …”
text -
17
18.086 Mathematical Methods for Engineers II, Spring 2005
Published 2005“…Scientific computing: Fast Fourier Transform, finite differences, finite elements, spectral method, numerical linear algebra. Complex variables and applications. Initial-value problems: stability or chaos in ordinary differential equations, wave equation versus heat equation, conservation laws and shocks, dissipation and dispersion. …”
Get full text
-
18
The $q=-1$ phenomenon for bounded (plane) partitions via homology concentration
Published 2009-01-01“…Algebraic complexes whose "faces'' are indexed by partitions and plane partitions are introduced, and their homology is proven to be concentrated in even dimensions with homology basis indexed by fixed points of an involution, thereby explaining topologically two quite important instances of Stembridge's $q=-1$ phenomenon. …”
Get full text
Article -
19
Proof of the Broué–Malle–Rouquier Conjecture in Characteristic Zero (After I. Losev and I. Marin—G. Pfeiffer)
Published 2019“…This is based on previous work of Losev, Marin– Pfeiffer, and Rains and the author. Keyword: Hecke algebra ; Complex reflection group ; Broué–Malle–Rouquier conjecture…”
Get full text
Article -
20
Characterization of Directed Graphs Representing C*-Algebra of Complex Matrices
Published 2024-01-01“…It is found that C*-algebra complex matrices n × n is a directed graph without cycles with n – 1 arrows, a single source, and has n path from the source.…”
Get full text
Article