On Dynamic Algorithms for Algebraic Problems

DOI10.1006/JAGM.1995.0807MaRDI QIDQ3128199zbMATH OpenOpenAlexFDO

Authors Stephen R. Tate, J. Reif

Publication date 16 April 1997

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL http://libres.uncg.edu/ir/uncg/f/S_Tate_On_1997.pdf

zbMATH Keywords

algebraic functions

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1003260
• Lower bounds for dynamic algebraic problems
• scientific article; zbMATH DE number 17841

Cited in

(7)

• A (slightly) faster algorithm for Klee's measure problem
• Lower bounds for dynamic algebraic problems
• Improved distance queries and cycle counting by Frobenius normal form
• scientific article; zbMATH DE number 1003260 (Why is no real title available?)
• Reachability is in DynFO
• \textsc{Dynark}: making Groth16 dynamic
• Proving relative lower bounds for incremental algorithms

This page was built for publication: On Dynamic Algorithms for Algebraic Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3128199)