7
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      On the efficiency of effective Nullstellens�tze

      , ,
      Computational Complexity
      Springer Nature

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references6

          • Record: found
          • Abstract: not found
          • Article: not found

          Fast Parallel Computation of Polynomials Using Few Processors

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            A fast parallel algorithm to compute the rank of a matrix over an arbitrary field

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              The membership problem for unmixed polynomial ideals is solvable in single exponential time

                Bookmark

                Author and article information

                Journal
                Computational Complexity
                Comput Complexity
                Springer Nature
                1016-3328
                1420-8954
                March 1993
                March 1993
                : 3
                : 1
                : 56-95
                Article
                10.1007/BF01200407
                ee2e3b9d-53d8-401e-a4fa-ed5f8d23f1f5
                © 1993
                History

                Comments

                Comment on this article