A general approach to removing degeneracies

Algorithms modeled as algebraic branching programs, with inputs from an infinite ordered field, are studied. Direct perturbations on the input, so that an algorithm designed under the assumption of nondegeneracy can be applied to all inputs, are described. A deterministic method for algorithms with determinant tests and a randomized one for arbitrary test expressions are defined. They both incur extra complexity factors that are constant in several cases. Moreover, polynomial and exponential time algorithms always remain in the same complexity class while being enhanced with the power to execute on arbitrary inputs. Both methods are distinguished by their conceptual elegance and are significantly faster than previous ones.<<ETX>>

[1]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[2]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[3]  John F. Canny,et al.  An efficient approach to removing geometric degeneracies , 1992, SCG '92.

[4]  Chee-Keng Yap,et al.  A geometric consistency theorem for a symbolic perturbation scheme , 1988, SCG '88.

[5]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[6]  Richard Zippel,et al.  Interpolating Polynomials from Their Values , 1990, J. Symb. Comput..

[7]  Walter Keller-Gehrig,et al.  Fast Algorithms for the Characteristic Polynomial , 1985, Theor. Comput. Sci..

[8]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[9]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[10]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[11]  J. Gathen.  Algebraic complexity theory , 1988 .

[12]  Clyde L. Monma,et al.  Computing euclidean maximum spanning trees , 1988, SCG '88.

[13]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[14]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[15]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[16]  Leonidas J. Guibas,et al.  Topologically sweeping an arrangement , 1986, STOC '86.

[17]  Herbert Edelsbrunner,et al.  Computing a Ham-Sandwich Cut in Two Dimensions , 1986, J. Symb. Comput..