Sciweavers

467 search results - page 8 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
70
Voted
DM
2002
93views more  DM 2002»
14 years 9 months ago
A proof of the q, t-Catalan positivity conjecture
We present here a proof that a certain rational function Cn(q, t) which has come to be known as the "q, t-Catalan" is in fact a polynomial with positive integer coeffici...
Adriano M. Garsia, James Haglund
95
Voted
ASAP
2008
IEEE
199views Hardware» more  ASAP 2008»
14 years 11 months ago
An efficient method for evaluating polynomial and rational function approximations
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented method for evaluating elementary functions using polynomial and rational functio...
Nicolas Brisebarre, Sylvain Chevillard, Milos D. E...
ISAAC
2010
Springer
240views Algorithms» more  ISAAC 2010»
14 years 7 months ago
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity
We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such pr...
Hugo Férée, Emmanuel Hainry, Mathieu...
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
15 years 9 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
DAGSTUHL
2004
14 years 11 months ago
On the Complexity of Parabolic Initial Value Problems with Variable Drift
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
Knut Petras, Klaus Ritter