English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  A Simple But Exact and Efficient Algorithm for Complex Root Isolation

Sagraloff, M., & Yap, C. (2011). A Simple But Exact and Efficient Algorithm for Complex Root Isolation. In A. Leykin (Ed.), ISSAC 2011 (pp. 353-360). New York, NY: ACM. doi:10.1145/1993886.1993938.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0010-11F6-7 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-ABBE-D
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Sagraloff, Michael1, Author           
Yap, Chee1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20112011
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 618678
DOI: 10.1145/1993886.1993938
URI: http://doi.acm.org/10.1145/1993886.1993938
Other: Local-ID: C1256428004B93B8-FDC2F7ABB4FB9CB3C1257861003BDC4D-SagraloffYap:CEVAL:2011
 Degree: -

Event

show
hide
Title: 36th International Symposium on Symbolic and Algebraic Computation
Place of Event: San Jose, CA, USA
Start-/End Date: 2011-06-08 - 2011-06-11

Legal Case

show

Project information

show

Source 1

show
hide
Title: ISSAC 2011
  Subtitle : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation
  Abbreviation : ISSAC 2011
Source Genre: Proceedings
 Creator(s):
Leykin, Anton1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 353 - 360 Identifier: ISBN: 978-1-4503-0675-1