Sciweavers

1695 search results - page 60 / 339
» Linear, Polynomial or Exponential
Sort
View
66
Voted
APPML
2004
45views more  APPML 2004»
15 years 21 days ago
The dissipative linear boltzmann equation
We introduce and discuss a linear Boltzmann equation describing dissipative interactions of a gas of test particles with a fixed background. For a pseudo-Maxwellian collision kern...
Giampiero Spiga, G. Toscani
IPL
2000
98views more  IPL 2000»
15 years 19 days ago
Linear complexity of the Naor-Reingold pseudo-random function
We obtain an exponential lower bound on the non-linear complexity of the new pseudo-random function, introduced recently by M. Naor and O. Reingold. This bound is an extension of t...
Igor Shparlinski
93
Voted
STOC
1999
ACM
132views Algorithms» more  STOC 1999»
15 years 5 months ago
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
Kevin D. Wayne
227
Voted
DNA
2011
Springer
213views Bioinformatics» more  DNA 2011»
14 years 18 days ago
Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes
Sticker complexes are a a formal graph-based data model for a restricted class of DNA complexes, motivated by potential applications to databases. This data model allows for a pure...
Robert Brijder, Joris J. M. Gillis, Jan Van den Bu...
106
Voted
CCCG
2008
15 years 2 months ago
Polynomial irreducibility testing through Minkowski summand computation
In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomials. Our work has been motivated by a recent work due to Gao et. al. [1, 2, 3] wh...
Deepanjan Kesh, Shashank K. Mehta