Skip to content

Adcock B On Efficient Algorithms for Computing Near-Best Polynomial Approx 2024

Sign up to create lists
Report Adcock B On Efficient Algorithms for Computing Near-Best Polynomial Approx 2024
Unverified source. This magnet is from an unverified source. The content may be unsafe or mislabeled. Proceed with caution.
Title: Adcock B On Efficient Algorithms for Computing NearGroup: NOGRP
Info Hash
306C56B93516A8B7E73E490F7E08C2CFC17199B9
Source
Unverified
Total Size
1.58 MB
Total Files
1
Seeders
1
Leechers
0
Health
1.00
Score
2
Type
eBook

File List

FileSize
Adcock B. On Efficient Algorithms for Computing Near-Best Polynomial Approx.2024/Adcock B. On Efficient Algorithms for Computing Near-Best Polynomial Approx.2024.pdf1.58 MB

Trackers

No trackers found.