• DocumentCode
    3326327
  • Title

    Randomized and deterministic algorithms for the dimension of algebraic varieties

  • Author

    Koiran, Pascal

  • Author_Institution
    Lab. LIP-IMAG, Ecole Normale Superieure de Lyon, France
  • fYear
    1997
  • fDate
    20-22 Oct 1997
  • Firstpage
    36
  • Lastpage
    45
  • Abstract
    We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale model of computation over C, that it admits a sO(1)DO(n) deterministic algorithm, and that for systems with integer coefficients it is in the Arthur-Merlin class under the Generalized Riemann Hypothesis. The first two results are based on a general derandomization argument
  • Keywords
    algebra; computational complexity; deterministic algorithms; randomised algorithms; Arthur-Merlin class; Generalized Riemann Hypothesis; NP-complete; algebraic varieties; complexity; deterministic algorithms; randomized algorithms; Computational modeling; Polynomials; Turing machines; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1997. Proceedings., 38th Annual Symposium on
  • Conference_Location
    Miami Beach, FL
  • ISSN
    0272-5428
  • Print_ISBN
    0-8186-8197-7
  • Type

    conf

  • DOI
    10.1109/SFCS.1997.646091
  • Filename
    646091
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3326327