Related papers: Analysis of Nederlof's algorithm for subset sum
Bell's theorem for systems more complicated than two qubits faces a hidden, as yet undiscussed, problem. One of the methods to derive Bell's inequalities is to assume existence of joint probability distribution for measurement results for…
This paper discusses a function that is frequently presented as a simile or look-alike of the so-called ``counterexample function to P=NP,'' that is, the function that collects all first instances of a problem in NP where a poly machine…
The main flaw of neural network ensembling is that it is exceptionally demanding computationally, especially, if the individual sub-models are large neural networks, which must be trained separately. Having in mind that modern DNNs can be…
An algorithm for unification modulo one-sided distributivity is an early result by Tid\'en and Arnborg. More recently this theory has been of interest in cryptographic protocol analysis due to the fact that many cryptographic operators…
The subdivision algorithm by Dellnitz and Hohmann for the computation of invariant sets of dynamical systems decomposes the relevant region of the state space into boxes and analyzes the induced box dynamics. Its convergence is proved in an…
This paper studies the average complexity on the number of comparisons for sorting algorithms. Its information-theoretic lower bound is $n \lg n - 1.4427n + O(\log n)$. For many efficient algorithms, the first $n\lg n$ term is easy to…
Massive sizes of real-world graphs, such as social networks and web graph, impose serious challenges to process and perform analytics on them. These issues can be resolved by working on a small summary of the graph instead . A summary is a…
Define the non-overlapping return time of a random process to be the number of blocks that we wait before a particular block reappears. We prove a Central Limit Theorem based on these return times. This result has applications to entropy…
Plagiarism is a pressing concern, even more so with the availability of large language models. Existing plagiarism detection systems reliably find copied and moderately reworded text but fail for idea plagiarism, especially in mathematical…
The problem of matching two sets of multiple elements, namely set-to-set matching, has received a great deal of attention in recent years. In particular, it has been reported that good experimental results can be obtained by preparing a…
For a set $A$, let $P(A)$ be the set of all finite subset sums of $A$. We prove that if a sequence $B=\{11\leq b_1<b_2<\cdots\}$ satisfies $b_2=3b_1+5$, $b_3=3b_2+2$ and $b_{n+1}=3b_n+4b_{n-1}$ for all $n\geq 3$, then there is a sequence of…
Sums of the form $\sum_{N_m=q}^{n}{\cdots \sum_{N_1=q}^{N_2}{a_{(m);N_m}\cdots a_{(1);N_1}}}$ where the $a_{(k);N_k}$'s are same or distinct sequences appear quite often in mathematics. We will refer to them as recurrent sums. In this…
Computing subgraph frequencies is a fundamental task that lies at the core of several network analysis methodologies, such as network motifs and graphlet-based metrics, which have been widely used to categorize and compare networks from…
We analyze the security of recently proposed image encryption scheme [1]. We show that the scheme is insecure and the methods used to evaluate its security are insufficient. By designing the Deliberately Weak Cipher, a completely vulnerable…
The modular subset sum problem consists of deciding, given a modulus $m$, a multiset $S$ of $n$ integers in $0..m-1$, and a target integer $t$, whether there exists a subset of $S$ with elements summing to $t \mod m $, and to report such a…
We consider the Subset Sum Ratio Problem ($SSR$), in which given a set of integers the goal is to find two subsets such that the ratio of their sums is as close to~1 as possible, and introduce a family of variations that capture additional…
We revisit the relegation algorithm by Deprit et al. (Celest. Mech. Dyn. Astron. 79:157-182, 2001) in the light of the rigorous Nekhoroshev's like theory. This relatively recent algorithm is nowadays widely used for implementing closed form…
Given a multiset $S$ of $n$ positive integers and a target integer $t$, the subset sum problem is to decide if there is a subset of $S$ that sums up to $t$. We present a new divide-and-conquer algorithm that computes all the realizable…
This paper summarizes a quantum algorithm of [R.D. Somma, et.al., Phys. Rev. Lett. 101, 130504 (2008)] that simulates a classical annealing process for solving discrete optimization problems. The complexity of the quantum algorithm scales…
In this paper we present a new mathematical conception based on a new method for ordering the integers. The method relies on the assumption that negative numbers are beyond infinity, which goes back to Wallis and Euler. We also present a…