Related papers: Analysis of Nederlof's algorithm for subset sum
Aslam presents an algorithm he claims will count the number of perfect matchings in any incomplete bipartite graph with an algorithm in the function-computing version of NC, which is itself a subset of FP. Counting perfect matchings is…
This paper presents a new combinatorial optimisation task, the Subset Sum Matching Problem (SSMP), which is an abstraction of common financial applications such as trades reconciliation. We present three algorithms, two suboptimal and one…
Using multisets, we develop novel techniques for mechanizing the proofs of the synthesis conjectures for list-sorting algorithms, and we demonstrate them in the Theorema system. We use the classical principle of extracting the algorithm as…
Several recently proposed code-based cryptosystems base their security on a slightly generalized version of the classical (syndrome) decoding problem. Namely, in the so-called restricted (syndrome) decoding problem, the error values stem…
We consider algebraic iterative reconstruction methods with applications in image reconstruction. In particular, we are concerned with methods based on an unmatched projector/backprojector pair; i.e., the backprojector is not the exact…
A computer simulation, such as a genetic algorithm, that uses IEEE standard floating-point arithmetic may not produce exactly the same results in two different runs, even if it is rerun on the same computer with the same input and random…
Despite their growing capabilities, language models still frequently reproduce content from their training data, generate repetitive text, and favor common grammatical patterns and vocabulary. A possible cause is the decoding strategy: the…
A set $\mathcal S\subset \mathbb N$ is said to be a subset-sum-distinct or dissociated if all of its finite subsets have different sums. Alternately, an equivalent classification is if any equality of the form $$\sum_{s\in \mathcal S}…
In the recent article arXiv:1606.03351, Apagodu and Zeilberger discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the end they…
Given a multiset $S$ of $n$ positive integers and a target integer $t$, the Subset Sum problem asks to determine whether there exists a subset of $S$ that sums up to $t$. The current best deterministic algorithm, by Koiliaris and Xu…
We show how to underapproximate the procedure summaries of recursive programs over the integers using off-the-shelf analyzers for non-recursive programs. The novelty of our approach is that the non-recursive program we compute may capture…
In this paper we examine a number of term rewriting system for integer number representations, building further upon the datatype defining systems described in [2]. In particular, we look at automated methods for proving confluence and…
Let $d\geq 2$ and $k\geq 1$ be fixed. We prove that, for every $\epsilon>0$ and every real $\beta$, there exist integers $1\leq b_1,\ldots,b_k\leq N$ such that \[ \left\|\sum_{j=1}^k b_j^{1/d}-\beta\right\| \ll_{d,k,\epsilon}…
In this paper, we extend our PrInDT method (Weihs, Buschfeld 2021) towards additional undersampling of one of the predictors. This helps us to handle multiple unbalanced data sets, i.e. data sets that are not only unbalanced with respect to…
We study the parameterized complexity of algorithmic problems whose input is an integer set $A$ in terms of the doubling constant $C := |A + A|/|A|$, a fundamental measure of additive structure. We present evidence that this new…
In Noor (2007)[Muhammad Aslam Noor, New iterative schemes for nonlinear equations, Appl. Math. Comput. 187 (2007) 937-943], proposed an algorithm namely \textbf{Algorithm 2.4} and established a proof to show cubic convergence. The presented…
We develop large sample theory for merged data from multiple sources. Main statistical issues treated in this paper are (1) the same unit potentially appears in multiple datasets from overlapping data sources, (2) duplicated items are not…
Bellman's algorithm for Subset Sum is one of the earliest and simplest examples of dynamic programming, dating back to 1957. For a given set of $n$ integers $X$ and a target $t$, it computes the set of subset sums $\mathcal S(X, t)$ (i.e.,…
Sampling errors in nested sampling parameter estimation differ from those in Bayesian evidence calculation, but have been little studied in the literature. This paper provides the first explanation of the two main sources of sampling errors…
The aim of this paper is to study a whole class of first order differential inclusions, which fit into the framework of perturbed sweeping process by uniformly prox-regular sets. After obtaining well-posedness results, we propose a…