English
Related papers

Related papers: Computing Limits of Quotients of Multivariate Real…

200 papers

A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.

Cryptography and Security · Computer Science 2007-12-27 Andreas Enge

Starting with an infinite set of non linear Equations for the Li-Keiper coefficients, we first specify a lower bound emerging from the infinite set and give a characterization of it. Then, we propose a possible new upper and lower bound for…

General Mathematics · Mathematics 2020-12-16 Merlini Danilo , Sala Massimo , Sala Nicoletta

We develop a weakest-precondition-style calculus \`a la Dijkstra for reasoning about amortized expected runtimes of randomized algorithms with access to dynamic memory - the $\textsf{aert}$ calculus. Our calculus is truly quantitative, i.e.…

Logic in Computer Science · Computer Science 2022-11-24 Kevin Batz , Benjamin Lucien Kaminski , Joost-Pieter Katoen , Christoph Matheja , Lena Verscht

The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.

Number Theory · Mathematics 2017-09-19 Amalaswintha Wolfsdorf

We present a focused introduction to exact penalty methods for nonlinear programs and mathematical programs with equilibrium constraints (MPECs), emphasizing their connection to modern error bound theory. The goal is twofold. First, we…

Optimization and Control · Mathematics 2026-05-04 Louis Shuo Wang

In order to realize a Quantum CPU some schemes for executing fundamental mathematical tasks are needed. In this paper we present some quantum circuits which, using elementary arithmetic operations, allow an approximated calculation of…

Quantum Physics · Physics 2007-05-23 G. Florio , D. Picca

We present a method for the numerical calculation of derivatives of functions of general complex matrices. The method can be used in combination with any algorithm that evaluates or approximates the desired matrix function, in particular…

High Energy Physics - Lattice · Physics 2016-10-13 M. Puhr , P. V. Buividovich

We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutine satisfiability modulo this theory, a problem for which there are several implementations available. The quantifier…

Logic in Computer Science · Computer Science 2008-09-04 David Monniaux

We establish bounds for the covariance of a large class of functions of infinite variance stable random variables, including unbounded functions such as the power function and the logarithm. These bounds involve measures of dependence…

Statistics Theory · Mathematics 2011-11-10 Vladas Pipiras , Murad S. Taqqu , Patrice Abry

Measuring attenuation coefficients is a fundamental problem that can be solved with diverse techniques such as X-ray or optical tomography and lidar. We propose a novel approach based on the observation of a sample from a few different…

Optimization and Control · Mathematics 2017-01-11 Valentin Debarnot , Jonas Kahn , Pierre Weiss

In this paper, we introduce a nonlinear optimization problem whose objective function is the convex log-sum-exp function and the feasible region is defined as a system of fuzzy relational inequalities (FRI) defined by the Lukasiewicz…

Optimization and Control · Mathematics 2022-06-22 Amin Ghodousian , Alireza Norouzi Azad , Hadi Amiri

We present straightforward proofs of estimates used in the adiabatic approximation. The gap dependence is analyzed explicitly. We apply the result to interpolating Hamiltonians of interest in quantum computing.

Quantum Physics · Physics 2007-11-08 Sabine Jansen , Mary-Beth Ruskai , Ruedi Seiler

In the present article we describe a class of algebraic curves on which rational functions of two arguments may reach all their possible limiting values. We also solve a similar question for functions that can be represented as a uniform…

Classical Analysis and ODEs · Mathematics 2007-05-23 Yaacov Tzeitlin

Let $g: \{-1,1\}^k \to \{-1,1\}$ be any Boolean function and $q_1,\dots,q_k$ be any degree-2 polynomials over $\{-1,1\}^n.$ We give a \emph{deterministic} algorithm which, given as input explicit descriptions of $g,q_1,\dots,q_k$ and an…

Computational Complexity · Computer Science 2013-11-28 Anindya De , Ilias Diakonikolas , Rocco A. Servedio

The possibilities for limit functions on a Fatou component for the iteration of a single polynomial or rational function are well understood and quite restricted. In non-autonomous iteration, where one considers compositions of arbitrary…

Dynamical Systems · Mathematics 2025-02-12 Mark Comerford , Christopher Staniszewski

In this paper we present an abstraction algorithm that produces a finite bisimulation quotient for an autonomous discrete-time linear system. We assume that the bisimulation quotient is required to preserve the observations over an…

Systems and Control · Computer Science 2012-03-30 Xuchu Ding , Mircea Lazar , Calin Belta

We give a {\em deterministic} algorithm for approximately computing the fraction of Boolean assignments that satisfy a degree-$2$ polynomial threshold function. Given a degree-2 input polynomial $p(x_1,\dots,x_n)$ and a parameter $\eps >…

Computational Complexity · Computer Science 2013-11-28 Anindya De , Ilias Diakonikolas , Rocco A. Servedio

Let $D$ be a connected bounded domain in $\R^2$, $S$ be its boundary which is closed, connected and smooth. Let $\Phi(z)=\frac 1 {2\pi i}\int_S\frac{f(s)ds}{s-z}$, $f\in L^1(S)$, $z=x+iy$. Boundary values of $\Phi(z)$ on $S$ are studied.…

Complex Variables · Mathematics 2023-06-27 Alexander G. Ramm

Many important quantities of interest are only partially identified from observable data: the data can limit them to a set of plausible values, but not uniquely determine them. This paper develops a unified framework for covariate-assisted…

Methodology · Statistics 2025-08-15 Eli Ben-Michael

Non-linearity of a Boolean function indicates how far it is from any linear function. Despite there being several strong results about identifying a linear function and distinguishing one from a sufficiently non-linear function, we found a…

Quantum Physics · Physics 2021-12-28 Debajyoti Bera , Tharrmashastha Sapv