相关论文: Some Quantitative Aspects of Fractional Computabil…

Fractional calculus is an effective tool in incorporating the effects of non-locality and memory into physical models. In this regard, successful applications exist rang- ing from signal processing to anomalous diffusion and quantum…

Digital System Research has pioneered the mathematics and design for a new class of computing machine using residue numbers. Unlike prior art, the new breakthrough provides methods and apparatus for general purpose computation using several…

The number partition problem is a well-known problem, which is one of 21 Karp's NP-complete problems \cite{karp}. The partition function is a boolean function that is equivalent to the number partition problem with number range restricted.…

The works presented in this habilitation concern the algorithmics of polynomials. This is a central topic in computer algebra, with numerous applications both within and outside the field - cryptography, error-correcting codes, etc. For…

The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…

For enumerative problems, i.e. computable functions f from N to Z, we define the notion of an effective (or closed) formula. It is an algorithm computing f(n) in the number of steps that is polynomial in the combined size of the input n and…

We propose a decision-theoretic framework for computational complexity, complementary to classical theory: moving from syntactic exactness (Turing / Shannon) to semantic simulability (Le Cam). While classical theory classifies problems by…

We determine the computational complexity of approximately counting and sampling independent sets of a given size in bounded-degree graphs. That is, we identify a critical density $\alpha_c(\Delta)$ and provide (i) for $\alpha <…

In computable analysis, sequences of rational numbers which effectively converge to a real number x are used as the (rho-) names of x. A real number x is computable if it has a computable name, and a real function f is computable if there…

We introduce an efficient variational hybrid quantum-classical algorithm designed for solving Caputo time-fractional partial differential equations. Our method employs an iterable cost function incorporating a linear combination of overlap…

We consider integer recurrences of the form a_n = f(a_{n-1}), where f is a quadratic polynomial with integer coefficients. We show, for four infinite families of f, that the set of primes dividing at least one term of such a sequence must…

We consider the non-parametric maximum likelihood estimation in the class of Polya frequency functions of order two, viz. the densities with a concave logarithm. This is a subclass of unimodal densities and fairly rich in general. The NPMLE…

For a relational structure ${\mathbb X}$ we investigate the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X}):=\{ f[X]: f\in \mathop{\rm Emb}\nolimits ({\mathbb X})\}$. Here we consider…

A conceptual difficulty in formulating the density functional theory of the fractional quantum Hall effect is that while in the standard approach the Kohn-Sham orbitals are either fully occupied or unoccupied, the physics of the fractional…

Complexity theory offers a variety of concise computational models for computing boolean functions - branching programs, circuits, decision trees and ordered binary decision diagrams to name a few. A natural question that arises in this…

Given $iid$ observations from an unknown absolute continuous distribution defined on some domain $\Omega$, we propose a nonparametric method to learn a piecewise constant function to approximate the underlying probability density function.…

Million-atom quantum simulations are in principle feasible with Orbital-Free Density Functional Theory (OF-DFT) because the algorithms only require simple functional minimizations with respect to the electron density function. In this…

The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of…

Factor Analysis (FA) is a technique of fundamental importance that is widely used in classical and modern multivariate statistics, psychometrics and econometrics. In this paper, we revisit the classical rank-constrained FA problem, which…

We study the basic computational problem of detecting approximate stationary points for continuous piecewise affine (PA) functions. Our contributions span multiple aspects, including complexity, regularity, and algorithms. Specifically, we…