English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Complexity Analysis of Root Clustering for a Complex Polynomial

Becker, R., Sagraloff, M., Sharma, V., Xu, J., & Yap, C. (2016). Complexity Analysis of Root Clustering for a Complex Polynomial. In M. Rosenkranz (Ed.), ISSAC 2016 (pp. 71-78). New York, NY: ACM. doi:10.1145/2930889.2930939.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-002B-02C0-E Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002C-83C2-5
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Becker, Ruben1, Author           
Sagraloff, Michael1, Author           
Sharma, Vikram2, Author           
Xu, Juan2, Author
Yap, Chee2, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 201620162016
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: BeckerISSAC2016
DOI: 10.1145/2930889.2930939
 Degree: -

Event

show
hide
Title: 41st International Symposium on Symbolic and Algebraic Computation
Place of Event: Waterloo, Canada
Start-/End Date: 2016-06-19 - 2016-06-22

Legal Case

show

Project information

show

Source 1

show
hide
Title: ISSAC 2016
  Abbreviation : ISSAC 2016
  Subtitle : Proceedings of the 2016 ACM Symposium on Symbolic and Algebraic Computation
Source Genre: Proceedings
 Creator(s):
Rosenkranz, Markus, Editor
Affiliations:
-
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 71 - 78 Identifier: ISBN: 978-1-4503-4380-0