On Dynamic Algorithms for Algebraic Problems

In this paper, we examine the problem of incrementally evaluating algebraic functions. In particular, iff(x1,x2,…,xn)=(y1,y2,…,ym) is an algebraic problem, we consider answering on-line requests of the form “change inputxito valuev” or “what is the value of outputyj?” We first present lower bounds f...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of algorithms Jg. 22; H. 2; S. 347 - 371
Hauptverfasser: Reif, John H., Tate, Stephen R.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: San Diego, CA Elsevier Inc 01.02.1997
Elsevier
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Theoretical computing
Algebraic function
Parallel algorithms
Algorithms
ISSN:0196-6774, 1090-2678
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we examine the problem of incrementally evaluating algebraic functions. In particular, iff(x1,x2,…,xn)=(y1,y2,…,ym) is an algebraic problem, we consider answering on-line requests of the form “change inputxito valuev” or “what is the value of outputyj?” We first present lower bounds for some simply stated algebraic problems such as multipoint polynomial evaluation, polynomial reciprocal, and extended polynomial GCD, proving an Ω(n) lower bound for the incremental evaluation of these functions. In addition, we prove two time-space trade-off theorems that apply to incremental algorithms for almost all algebraic functions. We then derive several general-purpose algorithm design techniques and apply them to several fundamental algebraic problems. For example, we give anO(n)time per request algorithm for incremental DFT. We also present a design technique for serving incremental requests using a parallel machine, giving a choice of either optimal work with respect to the sequential incremental algorithm or superfast algorithms withO(loglogn) time per request with a sublinear number of processors.
ISSN:0196-6774
1090-2678
DOI:10.1006/jagm.1995.0807