English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  A Complete, Exact and Efficient Implementation for Computing the Edge-adjacency Graph of an Arrangement of Quadrics

Hemmer, M., Dupon, L., Petitjean, S., & Schomer, E. (2011). A Complete, Exact and Efficient Implementation for Computing the Edge-adjacency Graph of an Arrangement of Quadrics. Journal of Symbolic Computation, 46(4), 467-494. doi:10.1016/j.jsc.2010.11.002.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Hemmer, Michael1, Author           
Dupon, Laurent2, Author
Petitjean, Sylvain2, Author
Schomer, Elmar1, 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: 20112011
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 618751
DOI: 10.1016/j.jsc.2010.11.002
URI: http://dx.doi.org/10.1016/j.jsc.2010.11.002
Other: Local-ID: C1256428004B93B8-21BB4C6D0F148A48C12579CA003A5CC7-Hemmer2011
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Journal of Symbolic Computation
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Amsterdam : Elsevier
Pages: - Volume / Issue: 46 (4) Sequence Number: - Start / End Page: 467 - 494 Identifier: ISSN: 0747-7171