Optimal and Nearly Optimal Algorithms for Approximating Polynomial Zeros

Computers and Mathematics with Applications - United Kingdom
doi 10.1016/0898-1221(96)00080-6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Nearly Optimal Pricing for Multiproduct Firms

2008English

Approximating Optimal Binary Decision Trees

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2011English

Finding Nearly Optimal GDT Scores

Journal of Computational Biology
GeneticsMolecular BiologyComputational TheorySimulationComputational MathematicsMathematicsModeling
2011English

A Conjecture of M. Golomb on Optimal and Nearly-Optimal Linear Approximation

Bulletin of the American Mathematical Society
1974English

Nearly Time-Optimal Paths for a Ground Vehicle

Journal of Control Theory and Applications
2003English

(Nearly) Sample-Optimal Sparse Fourier Transform

2013English

Algorithms for Optimal Dyadic Decision Trees

Machine Learning
Artificial IntelligenceSoftware
2010English

Cache-Optimal Algorithms for Option Pricing

ACM Transactions on Mathematical Software
Applied MathematicsSoftware
2010English

Nearly Optimal FIFO Buffer Management for Two Packet Classes

Computer Networks
Computer NetworksCommunications
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy