2766 search results - page 91 / 554 » Algorithms for trigonometric polynomials |
135
Voted
TRIER
2002
15 years 13 days ago
2002
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
110
Voted
ISAAC
2010
Springer
14 years 10 months ago
2010
Springer
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...
91
Voted
STOC
2003
ACM
16 years 1 months ago
2003
ACM
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
83
Voted
LICS
2005
IEEE
15 years 6 months ago
2005
IEEE
Number Decision Diagrams (NDD) are the automatabased symbolic representation for manipulating sets of integer vectors encoded as strings of digit vectors (least or most significa...
STOC
1995
ACM
15 years 4 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...