A note on testing the resultant
- Shub (in "From Topology to Computation: Proceedings of the Smalefest." (M. Hirsch, J. Marsden, and M. Shub, Eds.), pp. 281-301, Springer-Verlag, New York/Berlin, 1993) proposes to attack the complex PFull-size image (<1 K) versus the NPFull-size image (<1 K) problem by focussing on lower bounds on testing the resultant of quadratic forms for zero. Taking up this question we show in the present paper a lower bound of order n3 for the resultant.
Author: | Klaus MeerGND, Thomas Lickteig |
---|---|
URL: | http://www.sciencedirect.com/science/article/pii/S0885064X85710163?np=y |
DOI: | https://doi.org/10.1006/jcom.1995.1016 |
ISSN: | 0885-064X |
Title of the source (English): | Journal of Complexity |
Document Type: | Scientific journal article peer-reviewed |
Language: | English |
Year of publication: | 1995 |
Volume/Year: | 11 |
Issue number: | 3 |
First Page: | 344 |
Last Page: | 351 |
Faculty/Chair: | Fakultät 1 MINT - Mathematik, Informatik, Physik, Elektro- und Informationstechnik / FG Theoretische Informatik |