English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  A Near-optimal Algorithm for Computing Real Roots of Sparse Polynomials

Sagraloff, M. (2014). A Near-optimal Algorithm for Computing Real Roots of Sparse Polynomials. In K. Nabeshima (Ed.), ISSAC 2014 (pp. 359-366). New York, NY: ACM. doi:10.1145/2608628.2608632.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-4459-0 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-A25C-F
Genre: Conference Paper

Files

show Files

Locators

show

Creators

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

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20142014
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1145/2608628.2608632
BibTex Citekey: DBLP:conf/issac/Sagraloff14
 Degree: -

Event

show
hide
Title: 39th International Symposium on Symbolic and Algebraic Computation
Place of Event: Kobe, Japan
Start-/End Date: 2014-07-23 - 2014-07-25

Legal Case

show

Project information

show

Source 1

show
hide
Title: ISSAC 2014
  Subtitle : Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation ; Kobe, Japan, July, 23 - 25, 2014
  Abbreviation : ISSAC 2014
Source Genre: Proceedings
 Creator(s):
Nabeshima, Katsusuke1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 359 - 366 Identifier: ISBN: 978-1-4503-2501-1