Output-sensitive Algorithms for Sumset and Sparse Polynomial Multiplication

来源 :第八届工业与应用数学国际大会 | 被引量 : 0次 | 上传用户:q258007
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  We consider the complexity of multiplying two univariate polynomials given by their sparse representations.A product of sparse polynomials may have up to quadratically many terms compared to the inputs,but possibly as few as a constant number of terms.
其他文献
In this presentation we deal with stochastic boundary value problems for nonlinear partial integro-differential equations.
会议
In the multilevel Monte Carlo(MLMC)method numerous parameters have to be determined.
会议
This work has been motivated by the observation that the harmonic approximation becomes inadequate when the coarse-grain variables undergo large changes.
会议
We present new spectral solvers for time evolution of Partial Differential Equations in general domains.Based on the novel Fourier-Continuation(FC)method for the resolution of the Gibbs phenomenon,the
会议
As the radiation of energy to the far field is an important feature of most problems in wave theory,accurate and efficient near-field approximate radiation conditions are a necessary component of any
会议
In this work we consider the rendezvous problem of multi-agent systems with event-triggered control schemes.
会议
Hybrid systems are dynamical systems with continuous dynamics,discrete(logic)dynamics.and their interactions.
会议
We characterize the uniform exponential stability of a matrix-valued Markov chain via its non-ignorable periodic data.
会议
This talk will present a framework of dissipativity theory for switched systems using multiple storage functions and multiple supply rates.
会议
We designed a web interface to apply polynomial homotopy continuation to solve polynomial systems.Our problem is to classify the polynomial systems we have already solved.
会议