Polynomial

Results: 3445



#Item
551

Polynomial Bounds for the Grid-Minor Theorem Chandra Chekuri∗ Julia Chuzhoy† September 21, 2014

Add to Reading List

Source URL: ttic.uchicago.edu

Language: English - Date: 2014-09-27 11:30:17
    552

    Inverse Function Theorem for Polynomial Equations using Semidefinite Programming, Morteza Ashraphijuo, Ramtin Madani and Javad Lavaei Department of Electrical Engineering, Columbia University Abstract— This paper is c

    Add to Reading List

    Source URL: www.ieor.berkeley.edu

    Language: English - Date: 2015-03-24 14:17:42
      553

      The Journal of TRAUMA威 Injury, Infection, and Critical Care The Use of Polynomial Neural Networks for Mortality Prediction in Uncontrolled Venous and Arterial Hemorrhage David A. Roberts, MS, John B. Holcomb, MD, FACS

      Add to Reading List

      Source URL: ndpmetrics.com

      Language: English - Date: 2013-09-21 12:03:23
        554

        Computing representations of matroids of bounded branch-width Daniel Kr´al’∗ Abstract For every k ≥ 1 and two finite fields F and F 0 , we design a polynomial-time algorithm that given a matroid M of branch-width

        Add to Reading List

        Source URL: iti.mff.cuni.cz

        Language: English - Date: 2016-02-04 05:53:37
          555

          POLYNOMIAL & RATIONAL FUNCTIONS) NAME_______________________________ 1. Consider the function A. Plot in the window , .

          Add to Reading List

          Source URL: math.arizona.edu

          Language: English - Date: 2006-07-27 06:13:22
            556

            ´ THE POLYNOMIAL MULTIDIMENSIONAL SZEMEREDI THEOREM ALONG SHIFTED PRIMES NIKOS FRANTZIKINAKIS, BERNARD HOST, AND BRYNA KRA Abstract. If ~q1 , . . . , ~qm : Z → Z` are polynomials with zero constant terms and E ⊂

            Add to Reading List

            Source URL: www.math.northwestern.edu

            Language: English - Date: 2012-03-28 12:40:38
              557

              1 Rank-2 Matrix Solution for Semidefinite Relaxations of Arbitrary Polynomial Optimization Problems Ramtin Madani, Ghazal Fazelnia and Javad Lavaei

              Add to Reading List

              Source URL: www.ieor.berkeley.edu

              Language: English - Date: 2014-03-11 21:47:45
                558

                Low-Rank Solutions of Matrix Inequalities With Applications to Polynomial Optimization and Matrix Completion Problems Ramtin Madani, Ghazal Fazelnia, Somayeh Sojoudi and Javad Lavaei Abstract— This paper is concerned w

                Add to Reading List

                Source URL: www.ieor.berkeley.edu

                Language: English - Date: 2014-09-17 14:53:23
                  559

                  An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining Takeaki Uno1 , Hiroki Arimura2 1 2

                  Add to Reading List

                  Source URL: research.nii.ac.jp

                  Language: English - Date: 2010-09-24 01:42:10
                    560

                    QUALIFYING EXAMINATION Harvard University Department of Mathematics Tuesday, February 25, 1997 (DayFactor the polynomial x3 − x + 1 and find the Galois group of its splitting field if the

                    Add to Reading List

                    Source URL: math.harvard.edu

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