Results 11 to 20 of about 3,634,335 (213)
“SPOCU”: scaled polynomial constant unit activation function
Neural computing & applications (Print), 2020 We address the following problem: given a set of complex images or a large database, the numerical and computational complexity and quality of approximation for neural network may drastically differ from one activation function to another.
J. Kiselák +4 more
semanticscholar +1 more source
Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time [PDF]
Logical Methods in Computer Science, 2014 Lanford has shown that Feigenbaum's functional equation has an analytic solution. We show that this solution is a polynomial time computable function. This implies in particular that the so-called first Feigenbaum constant is a polynomial time computable
Peter Hertling, Christoph Spandl
doaj +1 more source
Dwork's congruences for the constant terms of powers of a Laurent polynomial [PDF]
, 2013 We prove that the constant terms of powers of a Laurent polynomial satisfy certain congruences modulo prime powers. As a corollary, the generating series of these numbers considered as a function of a p-adic variable satisfies a non-trivial analytic ...
A. Mellit, Masha Vlasenko
semanticscholar +1 more source
Sharp values for the constants in the polynomial Bohnenblust-Hille inequality [PDF]
, 2015 In this paper we prove that the complex polynomial Bohnenblust-Hille constant for $2$-homogeneous polynomials in ${\mathbb C}^2$ is exactly $\sqrt[4]{\frac{3}{2}}$.
Jiménez-Rodríguez, P. +3 more
core +6 more sources
Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor [PDF]
JACM, 2010 Ye [2011] showed recently that the simplex method with Dantzig’s pivoting rule, as well as Howard’s policy iteration algorithm, solve discounted Markov decision processes (MDPs), with a constant discount factor, in strongly polynomial time.
Thomas Dueholm Hansen +2 more
semanticscholar +1 more source
Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph [PDF]
Symposium on the Theory of Computing, 2016 In the Densest k-Subgraph (DkS) problem, given an undirected graph G and an integer k, the goal is to find a subgraph of G on k vertices that contains maximum number of edges.
Pasin Manurangsi
semanticscholar +1 more source
Hamming distance from irreducible polynomials over $\mathbb {F}_2$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 We study the Hamming distance from polynomials to classes of polynomials that share certain properties of irreducible polynomials. The results give insight into whether or not irreducible polynomials can be effectively modeled by these more general ...
Gilbert Lee +2 more
doaj +1 more source
Polynomial-Time Tensor Decompositions with Sum-of-Squares [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2016 We give new algorithms based on the sum-of-squares method for tensor decomposition. Our results improve the best known running times from quasi-polynomial to polynomial for several problems, including decomposing random overcomplete 3-tensors and ...
Tengyu Ma, Jonathan Shi, David Steurer
semanticscholar +1 more source
A Non-NP-Complete Algorithm for a Quasi-Fixed Polynomial Problem
Abstract and Applied Analysis, 2013 Let be a real-valued polynomial function of the form , with degree of in An irreducible real-valued polynomial function and a nonnegative integer are given to find a polynomial function satisfying the following expression: for some constant .
Yi-Chou Chen, Hang-Chin Lai
doaj +1 more source
Lebesgue functions and Lebesgue constants in polynomial interpolation
Journal of Inequalities and Applications, 2016 The Lebesgue constant is a valuable numerical instrument for linear interpolation because it provides a measure of how close the interpolant of a function is to the best polynomial approximant of the function.
Bayram Ali Ibrahimoglu
doaj +1 more source