科研之友
微信
新浪微博
Facebook
分享链接
摘要
This work studies the average complexity of solving structured polynomial systems that are characterised by a low evaluation cost, as opposed to the dense random model previously used. Firstly, we design a continuation algorithm that computes, with high probability, an approximate zero of a polynomial system given only as black box evaluation program. Secondly, we introduce a universal model of random polynomial systems with prescribed evaluation complexity L. Combining both, we show that we can compute an approximate zero of a random structured polynomial system with n equations of degree at most D inn variables with only poly(n, D)L operations with high probability. This exceeds the expectations implicit in Smale's 17th problem.
