Polynomial

Results: 3445



#Item
111

Algorithms and Data Structures (WS15/16) Example Solutions for Unit 7 Question 1 We will use here the following fact that was mentioned in class: Polynomial division can be done in O(n log n).

Add to Reading List

Source URL: www-tcs.cs.uni-sb.de

- Date: 2016-03-04 12:57:33
    112

    The Subset Sum Problem Reducing Time Complexity of NP-Completeness with Quantum Search Abstract The Subset Sum Problem is a member of the NPcomplete class, so no known polynomial time algorithm exists for it. Although th

    Add to Reading List

    Source URL: ciim.usf.edu

    - Date: 1980-01-01 00:00:00
      113

      CUBULATING MAPPING TORI OF POLYNOMIAL GROWTH FREE GROUP AUTOMORPHISMS MARK F. HAGEN AND DANIEL T. WISE Abstract. Let Φ : F → F be a polynomially-growing automorphism of a finite-rank free group F . Then G = F oΦ Z ac

      Add to Reading List

      Source URL: www.wescac.net

      - Date: 2016-05-25 10:09:54
        114

        Complexity of the Bollob´ as–Riordan Polynomial Exceptional Points and Uniform Reductions Markus Bl¨ asera , Holger Dellb,⋆ , and Johann A. Makowskyc,⋆⋆ a

        Add to Reading List

        Source URL: www-cc.cs.uni-saarland.de

        - Date: 2012-05-16 12:06:55
          115

          IMAGINARY PROJECTIONS OF POLYNOMIALS ¨ THORSTEN JORGENS, THORSTEN THEOBALD, AND TIMO DE WOLFF Abstract. We introduce the imaginary projection of a multivariate polynomial f ∈ C[z] as the projection of the variety of f

          Add to Reading List

          Source URL: www.math.uni-frankfurt.de

          - Date: 2016-02-09 17:25:47
            116

            Contemporary Mathematics The geometry of efficient arithmetic on elliptic curves David Kohel Abstract. The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms o

            Add to Reading List

            Source URL: iml.univ-mrs.fr

            - Date: 2014-03-31 06:18:09
              117

              The Complete Root Classification of a Parametric Polynomial on an Interval Songxin Liang Department of Applied Mathematics, The University

              Add to Reading List

              Source URL: www.apmaths.uwo.ca

              - Date: 2008-07-17 12:03:58
                118

                Finding an induced path of given parity in planar graphs in polynomial time Marcin Kami´nski ∗ Naomi Nishimura†

                Add to Reading List

                Source URL: rutcor.rutgers.edu

                - Date: 2011-09-12 05:29:52
                  119

                  arXiv:1411.5205v1 [math.PR] 19 NovUniversality of mesoscopic fluctuations for orthogonal polynomial ensembles Jonathan Breuer

                  Add to Reading List

                  Source URL: arxiv.org

                  - Date: 2014-11-19 20:29:41
                    120

                    j. differential geometry191 ON KNOTS WITH TRIVIAL ALEXANDER POLYNOMIAL Stavros Garoufalidis & Peter Teichner

                    Add to Reading List

                    Source URL: people.mpim-bonn.mpg.de

                    - Date: 2012-08-01 06:52:27
                      UPDATE