deutsch  english

Publication View

Smale: Complexity of Bezout's theorem V: Polynomial time (1994)

Abstract
The main goal of this paper is to show that the problem of finding approximately a zero of a polynomial system of equations can be solved in polynomial time,

Publication details
Download http://citeseerx.ist.psu.edu/viewdoc/summary?doi=?doi=10.1.1.33.1831
Source http://www.cityu.edu.hk/ma/staff/smale/pap95.ps
Contributors CiteSeerX
Repository CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Keywords e-mail, smale @ math.berkeley.edu
Type text
Language English
Relation 10.1.1.33.2329, 10.1.1.51.1515, 10.1.1.49.9221, 10.1.1.43.3980, 10.1.1.43.2737, 10.1.1.124.376, 10.1.1.26.4833, 10.1.1.44.1917, 10.1.1.42.2422, 10.1.1.35.8156, 10.1.1.112.9631, 10.1.1.48.6004, 10.1.1.111.6979, 10.1.1.51.5601, 10.1.1.22.1363, 10.1.1.22.7212, 10.1.1.44.3611, 10.1.1.111.9367, 10.1.1.110.1678, 10.1.1.44.8620, 10.1.1.126.767, 10.1.1.111.7459, 10.1.1.84.2608, 10.1.1.102.2978, 10.1.1.104.5513, 10.1.1.106.5584, 10.1.1.27.6536, 10.1.1.128.7575, 10.1.1.44.1540, 10.1.1.83.3824, 10.1.1.95.6753, 10.1.1.71.2042, 10.1.1.136.7938, 10.1.1.32.8844, 10.1.1.40.8716
 
About ScientificCommons    Imprint    Contact    Register URL    Help