Polynomial

Results: 3445



#Item
751

Classification of recursive functions into polynomial and superpolynomial complexity classes Carsten Sch¨urmann Department of Computer Science Yale University New Haven, CT 06511

Add to Reading List

Source URL: www.itu.dk

Language: English - Date: 2005-01-11 01:27:56
    752

    COMPACT: Reduction of a Polynomial in the Presence of Side Relations Anthony C. Hearn RAND Santa Monica CAEmail:

    Add to Reading List

    Source URL: reduce-algebra.com

    Language: English - Date: 2008-12-30 11:46:10
      753

      A SSIGNMENT 6 C OURSE : COMPSCI 590 Due Date: April 25, 2013, 11:59 PM Problem 1: Polynomial Multiplication of FFT:

      Add to Reading List

      Source URL: www.cs.duke.edu

      Language: English - Date: 2013-04-10 18:54:05
        754

        A Randomized Polynomial-Time Simplex Algorithm for Linear Programming ∗ †

        Add to Reading List

        Source URL: www.cs.duke.edu

        Language: English - Date: 2007-03-21 15:54:11
          755

          Local polynomial regression with truncated or censored response Maria Karlsson Eva Cantoni Xavier de Luna

          Add to Reading List

          Source URL: www.ifau.se

          Language: English - Date: 2010-06-03 06:39:47
            756

            Learning Sparse Polynomial Functions Alexandr Andoni∗ MSR Rina Panigrahy† MSR

            Add to Reading List

            Source URL: www.mit.edu

            Language: English - Date: 2013-11-12 13:39:38
              757

              C:/Dokumente und Einstellungen/wellmann/Desktop/Artikel Polynomial/Polynomial_WeHaMu.dvi

              Add to Reading List

              Source URL: www.statistik.tu-dortmund.de

              Language: English - Date: 2009-10-07 11:40:36
                758

                PROBLEM-SOLVING MASTERCLASS WEEK 4 1. Let p(z) be a polynomial of degree n, all of whose zeros have absolute value 1 in the complex plane. Put g(z) = p(z)/zn/2 . Show that all zeros of g 0 (z) = 0 have absolute value 1.

                Add to Reading List

                Source URL: math.stanford.edu

                Language: English - Date: 2007-10-25 15:49:08
                  759

                  [16] WINKLER, F., Polynomial Algorithms in Computer Algebra, Springer, 1996 (in pressZIPPEL, R., Effective Polynomial Computation, Kluwer, 1993. 4. References [1] BUCHBERGER, B., COLLINS, G. E., and LOOS, R. (ed

                  Add to Reading List

                  Source URL: www.dtc.umn.edu

                  Language: English - Date: 1998-04-13 22:06:33
                    760

                    Reachability in Register Machines with Polynomial Updates Alain Finkel1,? , Stefan G¨oller2 , and Christoph Haase1,? 1 2

                    Add to Reading List

                    Source URL: www.informatik.uni-bremen.de

                    Language: English - Date: 2013-06-18 14:22:46
                      UPDATE