English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

A Descartes Algorithm for Polynomials with Bit-Stream Coefficients

MPS-Authors
/persons/resource/persons44369

Eigenwillig,  Arno
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44766

Kettner,  Lutz
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45404

Schmitt,  Susanne
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45758

Wolpert,  Nicola
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Eigenwillig, A., Kettner, L., Krandick, W., Mehlhorn, K., Schmitt, S., & Wolpert, N. (2005). A Descartes Algorithm for Polynomials with Bit-Stream Coefficients. In V. G. Ganzha, E. W. Mayr, & E. V. Vorozhtsov (Eds.), Computer Algebra in Scientific Computing (pp. 138-149). Berlin, Germany: Springer. doi:10.1007/11555964_12.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2589-1
Abstract
There is no abstract available