On the complexity of incremental computation

DOI10.1007/3-540-55808-X_15MaRDI QIDQ5096828zbMATH OpenFDO

Authors Suresh Chari, Desh Ranjan, Pankaj Rohatgi

Publication date 18 August 2022

Published in Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55808-X_15

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• How easy is local search?
• scientific article; zbMATH DE number 4213452 (Why is no real title available?)
• scientific article; zbMATH DE number 3827200 (Why is no real title available?)
• scientific article; zbMATH DE number 176749 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• NP is as easy as detecting unique solutions

This page was built for publication: On the complexity of incremental computation

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