SIGN IN
SIGN UP
On determining the solvability of polynomials
Full Text:
PDF
Buy this Article
Authors:
K. Yokoyama
IIAS-SIS, FUJITSU LIMITED, 140 Miyamoto, Numazu-shi, 410-03, JAPAN
M. Noro
IIAS-SIS, FUJITSU LIMITED, 140 Miyamoto, Numazu-shi, 410-03, JAPAN
T. Takeshima
IIAS-SIS, FUJITSU LIMITED, 140 Miyamoto, Numazu-shi, 410-03, JAPAN
Published in:
· Proceeding
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Pages 127-134
ACM
New York, NY
, USA
©1990
table of contents
ISBN:0-201-54892-5
doi>
10.1145/96877.96910
1990 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 7
· Downloads (cumulative): 193
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
ISSAC'13
Share:
|
Tags:
algebraic algorithms
algorithms
computations on polynomials
graph algorithms
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder