Related papers: Some Results on the Complexity of Numerical Integr…
This book has seven chapters. In chapter one we give the basics needed to make this book a self contained one. Chapter two introduces the notion of interval semigroups and interval semifields and are algebraically analysed. Chapter three…
We show that there is a bijection between real-linear automorphisms of the multicomplex numbers of order $n$ and signed permutations of length $2^{n-1}$. This allows us to deduce a number of results on the multicomplex numbers, including a…
In this work we propose and analyse a numerical method for computing a family of highly oscillatory integrals with logarithmic singularities. For these quadrature rules we derive error estimates in terms of $N$, the number of nodes, $k$ the…
Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…
We study lower bounds on the worst-case error of numerical integration in tensor product spaces. As reference we use the $N$-th minimal error of linear rules that use $N$ function values. The information complexity is the minimal number $N$…
In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity. In this paper, we slightly modify this notion to obtain the so-called irreducible-expansion complexity which is more suitable for…
We search for some splitting (resp. finiteness) criteria of a given module $M$ over a local ring $(R,\fm,k)$ in terms of the splitting (resp. finiteness) property of certain cohomological functors evaluated at $M$. In particular, we deal…
The new combined formulas have been established for the complex and real rotation-angular functions arising in the evaluation of two-center overlap integrals over arbitrary atomic orbitals in molecular coordinate system. These formulas can…
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantum class BQP. 1. BQP is low for PP, i.e.,…
This paper is an essentially self-contained and rigorous description of the fundamental principles of quantum computing from a mathematical perspective. It is intended to help mathematicians who want to get a grasp of this quickly growing…
Quasi-Monte Carlo (QMC) methods for estimating integrals are attractive since the resulting estimators typically converge at a faster rate than pseudo-random Monte Carlo. However, they can be difficult to set up on arbitrary posterior…
This work is an analytical and numerical study of the composition of several fractals into one and of the relation between the composite dimension and the dimensions of the component fractals. In the case of composition of standard IFS with…
We prove exact complexity dichotomies for two quantum invariants of closed oriented three-manifolds, with the categorical data fixed. For a modular category $\mathcal{C}$, computing the Reshetikhin--Turaev invariant $Z_{\mathcal{C}}(M)$…
We present numerical results for massive non-planar two-loop box integrals entering heavy quark pair production at NNLO, some of which are not known analytically yet. The results have been obtained with the program SecDec 2.1, based on…
Quantum computers use quantum mechanical phenomena to perform conventionally intractable calculations for specific problems. Despite being universal machines, quantum computers are not expected to replace classical computers, but rather, to…
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: randomness and classification. The survey is divided in two parts…
As suggested by the title, this paper is a survey of recent results and questions on the collection of computably enumerable sets under inclusion. This is not a broad survey but one focused on the author's and a few others' current…
We often add arithmetic to extend the expressiveness of query languages and study the complexity of problems such as testing query containment and finding certain answers in the framework of answering queries using views. When adding…
This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
In this paper we give an overview of the quantum computational complexity class QMA and a description of known QMA-complete problems to date. Such problems are believed to be difficult to solve, even with a quantum computer, but have the…