๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Resolution of space curves complexity

โœ Scribed by Julio Castellanos

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
656 KB
Volume
106
Category
Article
ISSN
0022-4049

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Counting tritangent planes of space curv
Counting tritangent planes of space curves
โœ Thomas Banchoff; Terence Gaffney; Clint McCrory ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 714 KB
Bounds for the Genus of Space Curves
Bounds for the Genus of Space Curves
โœ Valentina Beorchia ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 537 KB

## Abstract We compute the following upper bounds for the maximal arithmetic genus __P~a~(d,t__) over all locally Cohen โ€ Macaulay space curves of degree __d__, which are not contained in a surface of degree magnified image These bounds are sharp for t โ‰ค 4 abd any d โ‰ฅ t.

The Space Complexity of Approximating th
The Space Complexity of Approximating the Frequency Moments
โœ Noga Alon; Yossi Matias; Mario Szegedy ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 172 KB

The frequency moments of a sequence containing m i elements of type i, 1 i n, are the numbers F k = n i=1 m k i . We consider the space complexity of randomized algorithms that approximate the numbers F k , when the elements of the sequence are given one by one and cannot be stored. Surprisingly, it

The Dataflow Time and Space Complexity o
The Dataflow Time and Space Complexity of FFTs
โœ A.P.W. Bohm; R.E. Hiromoto ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 747 KB

In this paper we analyze the performance of a recursive and an iterative fast Fourier transform algorithm, written in Id and run on MINT, a simulator for the Monsoon dataflow machine. Our complexity measures are: the number of instructions executed, the critical path length of the dataflow graph, an