English
Related papers

Related papers: Function spaces for second-order polynomial time

200 papers

A set is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own input to the oracle. We use autoreducibility to separate the polynomial-time hierarchy from polynomial space by showing that all…

Logic · Mathematics 2016-09-07 Harry Buhrman , Lance Fortnow , Leen Torenvliet , Dieter van Melkebeek

We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…

Group Theory · Mathematics 2015-03-09 J. C. Birget

Jacobian conjectures (that nonsingular implies invertible) for rational everywhere defined maps of real n-space to itself are considered, with no requirement for a constant Jacobian determinant or a rational inverse. The associated…

Algebraic Geometry · Mathematics 2013-01-21 L. Andrew Campbell

Under a condition that breaks the volume doubling barrier, we obtain a time polynomial structure result on the space of ancient caloric functions with polynomial growth on manifolds. As a byproduct, it is shown that the finiteness result…

Differential Geometry · Mathematics 2025-02-19 Fanghua Lin , Hongbing Qiu , Jun Sun , Qi S. Zhang

We study the existence of global implicit functions for equations defined on open subsets of Banach spaces. The partial derivative with respect to the second variable is only required to have a left inverse instead of being invertible.…

Optimization and Control · Mathematics 2021-08-18 Thomas Berger , Frédéric Haller

We show that for any given norm ball or proper cone, weak membership in its dual ball or dual cone is polynomial-time reducible to weak membership in the given ball or cone. A consequence is that the weak membership or membership problem…

Optimization and Control · Mathematics 2016-07-26 Shmuel Friedland , Lek-Heng Lim

This paper begins the study of infinite-dimensional modules defined on bicomplex numbers. It generalizes a number of results obtained with finite-dimensional bicomplex modules. The central concept introduced is the one of a bicomplex…

Functional Analysis · Mathematics 2011-08-10 Raphael Gervais Lavoie , Louis Marchildon , Dominic Rochon

A new class of bivariate poly-analytic Hermite polynomials is considered. We show that they are realizable as the Fourier-Wigner transform of the univariate complex Hermite functions and form a nontrivial orthogonal basis of the classical…

Complex Variables · Mathematics 2019-08-30 Allal Ghanmi , Khalil Lamsaf

In this paper we give a framework for describing how abstract systems can be used to compute if no randomness or error is involved. Using this we describe a class of classical "physical" computation systems whose computational capabilities…

Computational Complexity · Computer Science 2016-06-23 Richard Whyman

A polynomial-time algorithm for computing the permanent in any field of characteristic 3 is presented in this article. The principal objects utilized for that purpose are the Cauchy and Vandermonde matrices, the discriminant function and…

Computational Complexity · Computer Science 2007-08-28 Vadim Tarin

The paper is devoted to a comprehensive second-order study of a remarkable class of convex extended-real-valued functions that is highly important in many aspects of nonlinear and variational analysis, specifically those related to…

Optimization and Control · Mathematics 2015-07-21 Boris S. Mordukhovich , M. Ebrahim Sarabi

We propose a construction of actions of a quantum gauge field theory on a noncommutative space-time, based on a Fourier transform on the Doplicher-Fredenhagen-Roberts group. This approach leads to a functional integral representation of the…

Quantum Physics · Physics 2007-05-23 Nahum Zobin

Subspace representation is a fundamental technique in various fields of machine learning. Analyzing a geometrical relationship among multiple subspaces is essential for understanding subspace series' temporal and/or spatial dynamics. This…

Machine Learning · Computer Science 2024-09-16 Kazuhiro Fukui , Pedro H. V. Valois , Lincon Souza , Takumi Kobayashi

We consider the two-dimensional non-relativistic Coulomb problem with the aid of the momentum space construction of the associated Green's function. Our presentation has precursors in three dimensions. It is mainly Schwinger's approach…

Atomic Physics · Physics 2009-10-31 Walter Dittrich

There is a way of assigning a realizability notion to each degree of incomputability. In our setting, we make use of Weihrauch degrees (degrees of incomputability/discontinuity of partial multi-valued functions) to obtain Lifschitz-like…

Logic · Mathematics 2025-05-07 Takayuki Kihara

Solutions of matrix quantum mechanics have been shown to describe time dependent backgrounds in the holographically dual two dimensional closed string theory. We review some recent work dealing with non-trivial space-times which arise in…

High Energy Physics - Theory · Physics 2007-05-23 Sumit R. Das

We present definitions for real and quaternionic second-order free cumulants, functions whose collective vanshing when applied to elements from different subalgebras is equivalent to the second-order real (resp.\ quaternionic) freeness of…

Probability · Mathematics 2020-09-23 C. E. I. Redelmeier

For a complete noncompact Riemannian manifold with nonnegative Ricci curvature, we show that bounded biharmonic functions are constant and the space consists of biharmonic functions with polynomial growth of a fixed rate is finite…

Differential Geometry · Mathematics 2025-11-13 Lin Wang , Miaomiao Zhu

Many applications rely on solving time-dependent partial differential equations (PDEs) that include second derivatives. Summation-by-parts (SBP) operators are crucial for developing stable, high-order accurate numerical methodologies for…

Numerical Analysis · Mathematics 2024-03-04 Jan Glaubitz , Simon-Christian Klein , Jan Nordström , Philipp Öffner

The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness,…

Computational Complexity · Computer Science 2014-12-16 Abhishek Bhowmick , Shachar Lovett
‹ Prev 1 4 5 6 7 8 10 Next ›