Show simple item record

dc.contributor.authorKozen, Dexteren_US
dc.date.accessioned2007-04-23T16:37:26Z
dc.date.available2007-04-23T16:37:26Z
dc.date.issued1994-04en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR94-1446en_US
dc.identifier.urihttps://hdl.handle.net/1813/6232
dc.description.abstractWe give a new algorithm for resolving singularities of plane curves. The algorithm is polynomial time in the bit complexity model, does not require factorization, and works over the rationals or finite fields.en_US
dc.format.extent179777 bytes
dc.format.extent140210 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleEfficient Resolution of Singularities of Plane Curvesen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics