Polynomial

Results: 3445



#Item
31

Lower bounds for polynomial kernelization Michal Pilipczuk Institute of Informatics, University of Warsaw, Poland Parameterized Complexity Summer School

Add to Reading List

Source URL: algo2017.ac.tuwien.ac.at

Language: English - Date: 2017-09-02 11:43:44
    32

    Polynomial Functors Constrained by Regular Expressions A A

    Add to Reading List

    Source URL: ozark.hendrix.edu

    Language: English - Date: 2018-08-15 23:05:56
      33

      Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org CONVERGENCE THRESHOLDS OF NEWTON’S METHOD FOR MONOTONE POLYNOMIAL EQUATIONS JAVIER ESPARZA, STEFAN KIEFER, AND MICHAE

      Add to Reading List

      Source URL: drops.dagstuhl.de

      Language: English - Date: 2008-02-05 05:36:53
        34

        Benjamin Hutz* () and Adam Towsley. Thurston’s Theorem and Misiurewicz points for polynomial maps. The behavior of the critical points of a polynomial map plays an essential role in understan

        Add to Reading List

        Source URL: jointmathematicsmeetings.org

        Language: English - Date: 2013-09-15 00:44:45
          35

          THE STRONG TOPOLOGICAL MONODROMY CONJECTURE FOR COXETER HYPERPLANE ARRANGEMENTS ASILATA BAPAT AND ROBIN WALTERS ABSTRACT. The Bernstein–Sato polynomial, or the b-function, is an important invariant of hypersurface sing

          Add to Reading List

          Source URL: mathserver.neu.edu

          Language: English - Date: 2017-06-23 14:10:06
            36

            A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP Lu Li ∗, and Kim-Chuan Toh† 1 OctoberAbstract

            Add to Reading List

            Source URL: www.math.nus.edu.sg

            Language: English - Date: 2009-10-01 06:49:01
              37

              Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields Jean-Fran¸cois Biasse∗ Abstract This paper gives polynomial time quantum algorithms for

              Add to Reading List

              Source URL: fangsong.info

              Language: English - Date: 2018-07-17 14:44:28
                38

                Pseudorandom generators for low degree polynomials Andrej Bogdanov∗ March 3, 2005 Abstract We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite field

                Add to Reading List

                Source URL: www.cse.cuhk.edu.hk

                Language: English - Date: 2008-09-12 03:56:12
                  39

                  QUALIFYING EXAMINATION Harvard University Department of Mathematics Tuesday SeptemberDaya) Prove that the Galois group G of the polynomial X 6 + 3 over Q is of order 6.

                  Add to Reading List

                  Source URL: www.math.harvard.edu

                  Language: English - Date: 2016-02-04 13:15:16
                    UPDATE