×

Found 4 Documents (Results 1–4)

On the complexity of non-universal polynomial equation solving: old and new results. (English) Zbl 1107.65316

Pardo, Luis M. (ed.) et al., Foundations of computational mathematics, Santander 2005. Selected papers based on the presentations at the international conference of the Foundations of Computational Mathematics (FoCM), Santander, Spain, June 30 – July 9, 2005. Cambridge: Cambridge University Press (ISBN 0-521-68161-8/pbk). London Mathematical Society Lecture Note Series 331, 1-35 (2006).
MSC:  65H05 12Y05 26C10 30C15 65Y20
PDFBibTeX XMLCite

Straight-line programs in polynomial equation solving. (English) Zbl 1097.65063

Cucker, Felipe (ed.) et al., Foundations of computational mathematics: Minneapolis 2002 (FoCM 2002). Selected papers based on the plenary talks presented at FoCM 2002, Minneapolis, MN, USA, August 5–14, 2002. Cambridge: Cambridge University Press (ISBN 0-521-54253-7/pbk). London Mathematical Society Lecture Note Series 312, 96-136 (2004).
MSC:  65H05 12Y05 26C10 65Y20 30C15
PDFBibTeX XMLCite

Filter Results by …

Document Type

Year of Publication

all top 3

Main Field

all top 3

Software