相关论文: Deterministically finding an element of large orde…

These are pedagogical notes on Shor's factoring algorithm, which is a quantum algorithm for factoring very large numbers (of order of hundreds to thousands of bits) in polynomial time. In contrast, all known classical algorithms for the…

In this article, we design and analyze a Hybrid High-Order (HHO) finite element approximation for a class of strongly nonlinear boundary value problems. We consider an HHO discretization for a suitable linearized problem and show its…

In this paper we present the experimental results that more clearly than any theory suggest an answer to the question: when in detection of large (probably) prime numbers to apply, a very resource demanding, Miller-Rabin algorithm. Or, to…

The Hadamard maximal determinant (maxdet) problem is to find the maximum determinant D(n) of a square {+1, -1} matrix of given order n. Such a matrix with maximum determinant is called a saturated D-optimal design. We consider some cases…

Numerous algorithms call for computation over the integers modulo a randomly-chosen large prime. In some cases, the quasi-cubic complexity of selecting a random prime can dominate the total running time. We propose a new variant of the…

A quantum algorithm for computing the determinant of a unitary matrix $U\in U(N)$ is given. The algorithm requires no preparation of eigenstates of $U$ and estimates the phase of the determinant to $t$ binary digits accuracy with…

We present an $O^*\left(|\mathbb{F}|^{(R-n_*)\left(\sum_d n_d\right)+n_*}\right)$-time algorithm for determining whether a tensor of shape $n_0\times\dots\times n_{D-1}$ over a finite field $\mathbb{F}$ has rank $\le R$, where $n_*:=\max_d…

Submodular maximization is one of the central topics in combinatorial optimization. It has found numerous applications in the real world. In the past decades, a series of algorithms have been proposed for this problem. However, most of the…

We consider the NP-hard problem of minimizing a separable concave quadratic function over the integral points in a polyhedron, and we denote by D the largest absolute value of the subdeterminants of the constraint matrix. In this paper we…

Determining the prime factors of a given number N is a problem, which requires super-polynomial time for conventional digital computers. A polynomial-time algorithm was invented by P. Shor for quantum computers. However, the realization of…

A randomized algorithm for a search problem is *pseudodeterministic* if it produces a fixed canonical solution to the search problem with high probability. In their seminal work on the topic, Gat and Goldwasser posed as their main open…

This paper presents a new technique for deterministic length reduction. This technique improves the running time of the algorithm presented in \cite{LR07} for performing fast convolution in sparse data. While the regular fast convolution of…

We describe an algorithm computing an optimal prefix free code for $n$ unsorted positive weights in time within $O(n(1+\lg \alpha))\subseteq O(n\lg n)$, where the alternation $\alpha\in[1..n-1]$ measures the amount of sorting required by…

We extend a distributed finite element method built upon model order reduction to arbitrary polynomial degree using a hybrid Nitsche scheme. The new method considerably simplifies the transformation of the finite element system to the…

In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed {\em n-fold integer programming problems} are polynomial time solvable. Our proof involves two heavy ingredients…

In this paper we consider the filtering of a class of partially observed piecewise deterministic Markov processes (PDMPs). In particular, we assume that an ordinary differential equation (ODE) drives the deterministic element and can only…

Consider an n-vertex graph G = (V,E) of maximum degree Delta, and suppose that each vertex v \in V hosts a processor. The processors are allowed to communicate only with their neighbors in G. The communication is synchronous, i.e., it…

We present a deterministic distributed algorithm, in the LOCAL model, that computes a $(1+o(1))\Delta$-edge-coloring in polylogarithmic-time, so long as the maximum degree $\Delta=\tilde{\Omega}(\log n)$. For smaller $\Delta$, we give a…

We develop and analyse a first-order algorithm for the A-optimal experimental design problem. The problem is first presented as a special case of a parametric family of optimal design problems for which duality results and optimality…

In recent years, several powerful techniques have been developed to design {\em randomized} polynomial-space parameterized algorithms. In this paper, we introduce an enhancement of color coding to design deterministic polynomial-space…