Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
Suppose we are given a (possibly redundant) system of linear equalities and linear inequalities, C, and a solved form for C, and we now delete a constraint from C. We give an algorithm to incrementally compute a solved form for this new system. The algorithm has cost O(n2) where n is the number of constraints in C, while computing the solved form directly has expected cost O(n3). To our knowledge this is the first incremental algorithm for (re)computing a solved form after deleting a constraint. © 1995.
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
Robert E. Donovan
INTERSPEECH - Eurospeech 2001
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006