Related papers: Fonction complexit\'e associ\'ee \`a une applicati…
In this note, we consider the complexity of optimizing a highly smooth (Lipschitz $k$-th order derivative) and strongly convex function, via calls to a $k$-th order oracle which returns the value and first $k$ derivatives of the function at…
We further advance the study of the notion of computational complexity for 2d CFTs based on a gate set built out of conformal symmetry transformations. Previously, it was shown that by choosing a suitable cost function, the resulting…
We investigate the computational complexity of problems on toric ideals such as normal forms, Gr\"obner bases, and Graver bases. We show that all these problems are strongly NP-hard in the general case. Nonetheless, we can derive efficient…
A method is proposed for solving equality constrained nonlinear optimization problems involving twice continuously differentiable functions. The method employs a trust funnel approach consisting of two phases: a first phase to locate an…
We develop a static complexity analysis for a higher-order functional language with structural list recursion. The complexity of an expression is a pair consisting of a cost and a potential. The former is defined to be the size of the…
We strengthen the connections between electrical transformations and homotopy from the planar setting---observed and studied since Steinitz---to arbitrary surfaces with punctures. As a result, we improve our earlier lower bound on the…
In this article, we focus on the left translation actions on noncommutative compact connected Lie groups with topological dimension 3 or 4, consisting of ${\rm SU}(2),\,{\rm U}(2),\,{\rm SO}(3),\,{\rm SO}(3) \times S^1$ and ${{\rm…
We show how the complexity of higher-order functional programs can be analysed automatically by applying program transformations to a defunctionalized versions of them, and feeding the result to existing tools for the complexity analysis of…
We study the arithmetic analogue of maximal functions on diagonal hypersurfaces. This paper is a natural step following the papers of \cite{Magyar_dyadic}, \cite{Magyar_ergodic} and \cite{MSW}. We combine more precise knowledge of…
For the reconstruction problem, the universal representation of inverse Radon transforms implies the needed complexity of the direct Radon transforms which leads to the additional contributions. In the standard theory of generalized…
A translation surface of Euclidean space $\r^3$ is the sum of two regular curves $\alpha$ and $\beta$, called the generating curves. In this paper we classify the minimal translation surfaces of $\r^3$ and we give a method of construction…
Let $k$ be a locally compact complete field with respect to a discrete valuation $v$. Let $\oo$ be the valuation ring, $\m$ the maximal ideal and $F(x)\in\oo[x]$ a monic separable polynomial of degree $n$. Let $\delta=v(\dsc(F))$. The…
The clone of term operations of an algebraic structure consists of all operations that can be expressed by a term in the language of the structure. We consider bounds for the length and the height of the terms expressing these functions,…
The many-body Green's function theory with the random-phase approximation is applied to the study of easy-plane spin-1/2 ferromagnets in an in-plane magnetic field. We demonstrate that the usual procedure, in which only the three Green's…
Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…
Let $G$ be a locally compact group, and let $\Phi$ be a Young function. In this paper, we give sufficient and necessary conditions for weighted translation operators on the Orlicz space $L^\Phi(G)$ to be chaotic and topologically multiply…
In this paper, we deal with the robot motion planning problem in multi-valued function theory. We first enrich the multi-homotopy studies by introducing a multi-homotopy lifting property and a multi-fibration. Then we compute both a…
In this work we will review the notion of topological complexity, introduced by Michael Farber in 2003. We will use this theory of topological complexity to solve the motion planning problem of a mobile robot that navigates in the Euclidean…
In recent years, many types of elliptical Radon transforms that integrate functions over various sets of ellipses/ellipsoids have been considered, relating to studies in bistatic synthetic aperture radar, ultrasound reflection tomography,…
The complexity of computing the Fourier transform is a longstanding open problem. Very recently, Ailon (2013, 2014, 2015) showed in a collection of papers that, roughly speaking, a speedup of the Fourier transform computation implies…