eCommons

 

Rational Function Decomposition

dc.contributor.authorZippel, Richarden_US
dc.date.accessioned2007-04-23T17:53:36Z
dc.date.available2007-04-23T17:53:36Z
dc.date.issued1991-05en_US
dc.description.abstractThis paper presents a polynomial time algorithm for determining whether a given univariate rational function over an arbitrary field is the composition of two rational functions over that field, and finds them if so.en_US
dc.format.extent880151 bytes
dc.format.extent328617 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR91-1209en_US
dc.identifier.urihttps://hdl.handle.net/1813/7049
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleRational Function Decompositionen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
91-1209.pdf
Size:
859.52 KB
Format:
Adobe Portable Document Format
No Thumbnail Available
Name:
91-1209.ps
Size:
320.92 KB
Format:
Postscript Files