SIGN IN
SIGN UP
Computing monodromy via parallel homotopy continuation
Full Text:
Pdf
Buy this Article
Authors:
Anton Leykin
University of Minnesota, Minneapolis, MN
Frank Sottile
Texas A&M University, College Station, TX
Published in:
· Proceeding
PASCO '07
Proceedings of the 2007 international workshop on Parallel symbolic computation
Pages 97 - 98
ACM
New York, NY
, USA
©2007
table of contents
ISBN: 978-1-59593-741-4
doi>
10.1145/1278177.1278195
2007 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 3
· Downloads (cumulative): 57
· 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:
algorithm design and analysis
algorithms
distributed computing
experimentation
galois group
parallel and vector implementations
parallel processing
polynomial homotopy continuation monodromy
schubert problems
theory
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