Results 21 to 30 of about 6,692,580 (276)
The Resource constrained shortest path problem implemented in a lazy functional language [PDF]
, 1996 The resource constrained shortest path problem is an NP-hard problem for which many ingenious algorithms have been developed. These algorithms are usually implemented in FORTRAN or another imperative programming language.
Hartel, Pieter H., Glaser, Hugh
core +2 more sources
On fluxes in the 19 Landau-Ginzburg model
Journal of High Energy Physics, 2023 In this paper we present a large class of flux backgrounds and solve the shortest vector problem in type IIB string theory on an orientifold of the 19 Landau-Ginzburg model.
Katrin Becker +2 more
doaj +1 more source
Efficient algorithms for the reverse shortest path problem on trees under the hamming distance [PDF]
Yugoslav Journal of Operations Research, 2017 Given a network G(V,A,c) and a collection of origin-destination pairs with prescribed values, the reverse shortest path problem is to modify the arc length vector c as little as possible under some bound constraints such that the shortest ...
Tayyebi Javad, Aman Massoud
doaj +1 more source
Towards an efficient LWE‐based fully homomorphic encryption scheme
IET Information Security, 2022 The security of most early fully homomorphic encryption schemes was based on the hardness of the Learning with Errors (LWE) problem. These schemes were inefficient in terms of per gate computations and public‐key size.
Uddipana Dowerah +1 more
doaj +1 more source
Multiple Manifold Clustering Using Curvature Constrained Path. [PDF]
PLoS ONE, 2015 The problem of multiple surface clustering is a challenging task, particularly when the surfaces intersect. Available methods such as Isomap fail to capture the true shape of the surface near by the intersection and result in incorrect clustering.
Amir Babaeian +2 more
doaj +1 more source
Efficient Implementations of Sieving and Enumeration Algorithms for Lattice-Based Cryptography
Mathematics, 2021 The security of lattice-based cryptosystems is based on solving hard lattice problems such as the shortest vector problem (SVP) and the closest vector problem (CVP).
Hami Satılmış +2 more
doaj +1 more source
Finding next-to-shortest paths in a graph [PDF]
, 2004 We study the problem of finding the next-to-shortest paths in a graph. A next-to-shortest $(u,v)$-path is a shortest $(u,v)$-path amongst $(u,v)$-paths with length strictly greater than the length of the shortest $(u,v)$-path.
Krasikov, I +3 more
core +1 more source
Using Variational Quantum Algorithm to Solve the LWE Problem
Entropy, 2022 The variational quantum algorithm (VQA) is a hybrid classical–quantum algorithm. It can actually run in an intermediate-scale quantum device where the number of available qubits is too limited to perform quantum error correction, so it is one of the most
Lihui Lv +6 more
doaj +1 more source
Algorithms for the Shortest and Closest Lattice Vector Problems [PDF]
, 2011 We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problems, namely the algorithm by Micciancio and Voulgaris based on the Voronoi cell [STOC'10], the Monte-Carlo algorithms derived from the Ajtai, Kumar and Sivakumar algorithm ...
Hanrot, Guillaume +2 more
openaire +2 more sources
Improving BDD Enumeration for LWE Problem Using GPU
IEEE Access, 2020 In this paper, we present a GPU-based parallel algorithm for the Learning With Errors (LWE) problem using a lattice-based Bounded Distance Decoding (BDD) approach.
Mohamed S. Esseissah +2 more
doaj +1 more source