Polynomial

Results: 3445



#Item
601

MHF 4U Unit 1 –Polynomial Functions– Outline Day 1 Lesson Title

Add to Reading List

Source URL: www.edugains.ca

Language: English - Date: 2010-11-01 15:27:57
    602

    Polynomial Space and Delay Algorithms for Enumeration of Maximal Motifs in a Sequence Hiroki Arimura1? and Takeaki Uno2 1 Hokkaido University, Kita 14-jo, Nishi 9-chome, Sapporo, JAPAN

    Add to Reading List

    Source URL: research.nii.ac.jp

    Language: English - Date: 2010-06-28 00:10:20
      603

      SAT Solving for Termination Analysis with Polynomial Interpretations⋆⋆⋆ Carsten Fuhs1 , J¨ urgen Giesl1 , Aart Middeldorp2 , Peter Schneider-Kamp1 , Ren´e Thiemann1 , and Harald Zankl2 1

      Add to Reading List

      Source URL: verify.rwth-aachen.de

      Language: English - Date: 2015-04-16 09:50:00
        604

        MOMENT PROBLEM IN INFINITELY MANY VARIABLES MEHDI GHASEMI1 , SALMA KUHLMANN2 , MURRAY MARSHALL1 Abstract. The multivariate moment problem is investigated in the general context of the polynomial algebra R[xi | i ∈ Ω]

        Add to Reading List

        Source URL: math.usask.ca

        Language: English - Date: 2015-04-21 12:46:08
          605

          Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors

          Add to Reading List

          Source URL: www.theoryofcomputing.org

          Language: English - Date: 2014-11-14 13:01:30
            606

            Chapter 5: The Joints Problem Adam Sheffer April 21, 2015 In some sense the topic of this course originated from a paper by Guth and Katz [3], in which they used polynomial methods to solve two problems. One of these pro

            Add to Reading List

            Source URL: www.math.caltech.edu

            Language: English - Date: 2015-04-21 21:53:02
              607

              Polynomial Flow-Cut Gaps and Hardness of Directed Cut Problems∗ Julia Chuzhoy† Sanjeev Khanna‡ December 10, 2008

              Add to Reading List

              Source URL: ttic.uchicago.edu

              Language: English - Date: 2008-12-10 14:27:31
                608Computational complexity theory / Complexity classes / Theory of computation / Polynomial hierarchy / P versus NP problem / IP / True quantified Boolean formula / NP / PP / Oracle machine / PSPACE-complete / Polynomial-time reduction

                February 3, 2009 COM S 6810 Theory of Computing Lecture 5: Polynomial Hierarchy Instructor: Rafael Pass

                Add to Reading List

                Source URL: www.cs.cornell.edu

                Language: English - Date: 2009-02-04 17:20:26
                609

                Elliptic Curves and Galois Representations Caleb McWhorter Fall 2014 General Motivation Diophantine equations are the study of solutions of polynomial equations in integers or rationals. Take the

                Add to Reading List

                Source URL: mgo.syr.edu

                Language: English - Date: 2015-10-06 20:12:25
                  610

                  General Spline Filters for Discontinuous Galerkin Solutions J¨org Peters July 16, 2015 Abstract The discontinuous Galerkin (dG) method outputs a sequence of polynomial pieces. Post-processing the sequence by Smoothness-

                  Add to Reading List

                  Source URL: www.cise.ufl.edu

                  Language: English - Date: 2015-07-21 08:38:37
                    UPDATE