We develop a probabilistic polynomial time algorithm which on input a polynomial \(g\left(x_{1}, \ldots, x_{n}\right)\) over \(G F[2], \epsilon\) and \(\delta\), outputs an approximation to the number of zeroes of \(g\) with relative error at most \(\epsilon\) with probability at least \(1-\delta\).
β¦ LIBER β¦
Approximate Zeros and Condition Numbers
β Scribed by Felipe Cucker
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 134 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0885-064X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Approximating the Number of Zeroes of a
β
M. Karpinski; M. Luby
π
Article
π
1993
π
Elsevier Science
π
English
β 325 KB
Relations between Approximation Numbers
β
H. Triebel
π
Article
π
1994
π
Elsevier Science
π
English
β 134 KB
Condition numbers, iterative refinement
β
John H. Kalivas; Patrick Lang
π
Article
π
1989
π
John Wiley and Sons
π
English
β 404 KB
Structured condition numbers of large To
β
A. BΓΆttcher; S. M. Grudsky
π
Article
π
2004
π
John Wiley and Sons
π
English
β 95 KB
Uniformly Approximable Numbers and the U
β
Edward B. Burger
π
Article
π
1996
π
Elsevier Science
π
English
β 475 KB
We say a real number : is uniformly approximable if the upper bound in Dirichlet's theorem, from diophantine approximation, of 1Γ(Q+1) q may be sharpened to c(:)Γ(Q+1) 2 for all sufficiently large Q. Here we begin by showing that the set of uniformly approximable numbers is precisely the set of badl
Smoothed analysis of some condition numb
β
F. Cucker; H. Diao; Y. Wei
π
Article
π
2006
π
John Wiley and Sons
π
English
β 130 KB