Home

Any Iteration for Polynomial Equations Using Linear Information Has Infinite Complexity

Grzegorz W. Wasilkowski

Title:
Any Iteration for Polynomial Equations Using Linear Information Has Infinite Complexity
Author(s):
Wasilkowski, Grzegorz W.
Date:
Type:
Technical reports
Department:
Computer Science
Permanent URL:
Series:
Columbia University Computer Science Technical Reports
Part Number:
CUCS-145-79
Publisher:
Department of Computer Science, Columbia University
Publisher Location:
New York
Subject(s):
Computer science
Item views:
377
Metadata:
text | xml

In Partnership with the Center for Digital Research and Scholarship at Columbia University Libraries/Information Services | Terms of Use