Results 81 to 90 of about 4,224,396 (192)
Performance comparison of quantum-safe multivariate polynomial public key encapsulation algorithm
EURASIP Journal on Information SecurityA novel quantum-safe key encapsulation algorithm, called Multivariate Polynomial Public Key (MPPK), was recently proposed by Kuang, Perepechaenko, and Barbeau.
Randy Kuang +3 more
doaj +1 more source
On Linear Diophantine Equations and Fibonacci Numbers
Journal of Number Theory, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables
, 1998 We develop an algorithm for solving a linear diophantine equation with lower and upper bounds on the variables. The algorithm is based on lattice basis reduction, and first finds short vectors satisfying the diophantine equation.
Lenstra, A.K. +5 more
core +1 more source
We solve a problem posed recently by J.H.E. Cohn, in proving that x = y = 1 is the only solution in nonnegative integers to the diophantine equation x^2 - 3 y^4 = -2.diophantine ...
Weger, B.M.M. de
core +3 more sources
Discrete Mathematics, 1975 AbstractIn this paper we present necessary and sufficient conditions for the existence of solutions to more general systems of linear diophantine equations and inequalities than have previously been considered. We do this in terms of variants and extensions of generalized inverse concepts which also permit us to give representation of the set of all ...
Abraham Charnes, Frieda Granot
openaire +3 more sources
, 1997 This paper investigates properties of the minimal integral solutions of a linear diophantine equation. We present best possible inequalities that must be satisfied by these elements which improves on former results.
Weismantel, Robert, Henk, Martin
core +1 more source
A note on equivalent systems of linear diophantine equations [PDF]
Zeitschrift für Operations Research, 1973 Another constructive proof is presented for the fact that a system of linear equations with integer coefficients in bounded integer variables is equivalent to a single equation, which is a linear combination of the original ones. The equation is obtained in a number of steps; in each step two equations are replaced by a single one.
openaire +3 more sources
Efficient digital quadratic unconstrained binary optimization solvers for SAT problems
New Journal of PhysicsBoolean satisfiability (SAT) is a propositional logic problem of determining whether an assignment of variables satisfies a Boolean formula. Many combinatorial optimization problems can be formulated in Boolean SAT logic—either as k -SAT decision ...
Robert Simon Fong +2 more
doaj +1 more source
An Improved Unbounded-DP Algorithm for the Unbounded Knapsack Problem with Bounded Coefficients
MathematicsBenchmark instances for the unbounded knapsack problem are typically generated according to specific criteria within a given constant range R, and these instances can be referred to as the unbounded knapsack problem with bounded coefficients (UKPB).
Yang Yang
doaj +1 more source
MathematicsThis paper presents a decentralized adaptive generalized-minimum-variance (GMV) control framework for large-scale stochastic nonlinear systems composed of interconnected multi-input multi-output (MIMO) Hammerstein subsystems with unknown time-varying ...
Slim Dhahri +6 more
doaj +1 more source