Related papers: Algebraic number fields and the LLL algorithm
Finding the length of the longest increasing subsequence (LIS) is a classic algorithmic problem. Let $n$ denote the size of the array. Simple $O(n\log n)$ algorithms are known for this problem. We develop a polylogarithmic time randomized…
Our primary concern is the computational complexity of algorithms that find all Carmichael numbers less than some specified bound $B$. We have three related results. First, we show CARMICHAELS is in $\textbf{P}$, where only the run-time is…
We investigate the question if quantum algorithms exist that compute the maximum of a set of conjugated elements of a given number field in quantum polynomial time. We will relate the existence of these algorithms for a certain family of…
A class of explicit numerical schemes is developed to solve for the relativistic dynamics and spin of particles in electromagnetic fields, using the Lorentz-BMT equation formulated in the Clifford algebra representation of Baylis. It is…
Integer linear programs $\min\{c^T x : A x = b, x \in \mathbb{Z}^n_{\ge 0}\}$, where $A \in \mathbb{Z}^{m \times n}$, $b \in \mathbb{Z}^m$, and $c \in \mathbb{Z}^n$, can be solved in pseudopolynomial time for any fixed number of constraints…
The standard oracle model for matroid algorithms assumes that each independence query can be answered in constant time, regardless of the size of the queried set. While this abstraction has underpinned much of the theoretical progress in…
For any $\ell > 0$, we present an algorithm which takes as input a semi-algebraic set, $S$, defined by $P_1 \leq 0,...,P_s \leq 0$, where each $P_i \in \R[X_1,...,X_k]$ has degree $\leq 2,$ and computes the top $\ell$ Betti numbers of $S$,…
DeepLLL algorithm (Schnorr, 1994) is a famous variant of LLL lattice basis reduction algorithm, and PotLLL algorithm (Fontein et al., 2014) and $S^2$LLL algorithm (Yasuda and Yamaguchi, 2019) are recent polynomial-time variants of DeepLLL…
In the Split to Block Vertex Deletion and Split to Threshold Vertex Deletion problems the input is a split graph $G$ and an integer $k$, and the goal is to decide whether there is a set $S$ of at most $k$ vertices such that $G-S$ is a block…
General quantum computation consists of unitary operations and also measurements. It is well known that intermediate quantum measurements can be deferred to the end of the computation, resulting in an equivalent purely unitary computation.…
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic problems of a code. While these problems are known to be hard for…
Quantum algorithms for computational linear algebra promise up to exponential speedups for applications such as simulation and regression, making them prime candidates for hardware realization. But these algorithms execute in a model that…
In this article we present two mechanisms for deducing logarithmic quantitative unique continuation bounds for certain classes of integral operators. In our first method, expanding the corresponding integral kernels, we exploit the…
A fundamental problem in computer science is to find all the common zeroes of $m$ quadratic polynomials in $n$ unknowns over $\mathbb{F}_2$. The cryptanalysis of several modern ciphers reduces to this problem. Up to now, the best complexity…
The works presented in this habilitation concern the algorithmics of polynomials. This is a central topic in computer algebra, with numerous applications both within and outside the field - cryptography, error-correcting codes, etc. For…
The paper reports on a computer algebra program LSSS (Linear Selective Systems Solver) for solving linear algebraic systems with rational coefficients. The program is especially efficient for very large sparse systems that have a solution…
The impressive performance of Large Language Models (LLMs) across various natural language processing tasks comes at the cost of vast computational resources and storage requirements. One-shot pruning techniques offer a way to alleviate…
In this paper, we study the weighted $k$-server problem on the uniform metric in both the offline and online settings. We start with the offline setting. In contrast to the (unweighted) $k$-server problem which has a polynomial-time…
We present an algorithm for generating approximations for the logarithm of Barnes $G$-function in the half-plane $Re(z)\ge 3/2$. These approximations involve only elementary functions and are easy to implement. The algorithm is based on a…
Quantum algorithms are a very promising field. However, creating and manipulating these kind of algorithms is a very complex task, specially for software engineers used to work at higher abstraction levels. The work presented here is part…