Eurosam 84
DOI: 10.1007/bfb0032861
|View full text |Cite
|
Sign up to set email alerts
|

On pseudo-resultants

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…Clearly,e fficient algorithms to compute resultants are connected to the GCD problem and we refer to Collins (1971) [42], Schwartz (1980) [157], and Rothstein (1984) [145].…”
Section: Integerand Polynomial Greatest Common Divisor (Gcd)mentioning
confidence: 99%
“…Clearly,e fficient algorithms to compute resultants are connected to the GCD problem and we refer to Collins (1971) [42], Schwartz (1980) [157], and Rothstein (1984) [145].…”
Section: Integerand Polynomial Greatest Common Divisor (Gcd)mentioning
confidence: 99%