467 search results - page 39 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
120
click to vote
CONSTRAINTS
2008
14 years 12 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
116
click to vote
INFOCOM
2000
IEEE
15 years 4 months ago
2000
IEEE
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their po...
EUROCRYPT
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of ver...
111
click to vote
CAL
2002
14 years 11 months ago
2002
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...