1092 search results - page 28 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
132
click to vote
TIM
2010
14 years 6 months ago
2010
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
ISSAC
2009
Springer
15 years 6 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
117
click to vote
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
107
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...
88
Voted
TCOM
2010
14 years 6 months ago
2010
The class of variable-length finite-state joint source-channel codes is defined and a polynomial complexity algorithm for the evaluation of their distance spectrum presented. Issu...