Suchergebnisse - "Numerical Algorithms AND Problems—Computations on polynomials*"

  • Treffer 1 - 9 von 9
Treffer weiter einschränken
  1. 1

    Explicit Lower Bounds via Geometric Complexity Theory (Extended Abstract)

    Autoren: Peter Bürgisser Christian Ikenmeyer The Pennsylvania State University CiteSeerX Archives

    Weitere Verfasser: Peter Bürgisser Christian Ikenmeyer The Pennsylvania State University CiteSeerX Archives

    Quelle: http://math-www.upb.de/agpb/work/arxiv1210.8368v1.pdf.

    Schlagwörter: Measures andClasses, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—Computations on polynomials General Terms Algorithms, Theory Keywords geometric complexitytheory, tensorrank, matrixmultiplication, Kronecker coefficients, permanent versus determinant

    Dateibeschreibung: application/pdf

    Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.779

    Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.779
    http://math-www.upb.de/agpb/work/arxiv1210.8368v1.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  2. 2

    Solving polynomial equations in smoothed polynomial time and a near solution to Smale’s 17th problem

    Autoren: Peter Bürgisser Felipe Cucker The Pennsylvania State University CiteSeerX Archives

    Weitere Verfasser: Peter Bürgisser Felipe Cucker The Pennsylvania State University CiteSeerX Archives

    Quelle: http://math-www.upb.de/agpb/work/stoc149-buergisser.pdf.

    Schlagwörter: Categories and Subject Descriptors F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—computations on polynomials, G.1.5 [Numerical Analysis, Roots of Nonlinear Equations—Continuation (homotopy) methods

    Dateibeschreibung: application/pdf

    Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.744

    Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.744
    http://math-www.upb.de/agpb/work/stoc149-buergisser.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  3. 3

    On Lacunary Polynomial Perfect Powers

    Autoren: Mark Giesbrecht Daniel S: ROche The Pennsylvania State University CiteSeerX Archives

    Weitere Verfasser: Mark Giesbrecht Daniel S: ROche The Pennsylvania State University CiteSeerX Archives

    Quelle: http://www.cs.uwaterloo.ca/~mwg/research/files/lacunary-pp.pdf.

    Schlagwörter: Categories and Subject Descriptors I.1.2 [Symbolic and Algebraic Manipulation, Algorithms—Algebraic algorithms, Analysis of algorithms, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—Computations on polynomials, Number-theoretic computations General Terms Algorithms Keywords Lacunary polynomial, black box polynomial, sparse polynomial, perfect

    Dateibeschreibung: application/pdf

    Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.6774

    Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.6774
    http://www.cs.uwaterloo.ca/~mwg/research/files/lacunary-pp.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  4. 4

    Optimal Complexity Lower Bound for Polynomial Multiplication

    Autoren: Peter Bürgisser Martin Lotz The Pennsylvania State University CiteSeerX Archives

    Weitere Verfasser: Peter Bürgisser Martin Lotz The Pennsylvania State University CiteSeerX Archives

    Quelle: http://math-www.upb.de/agpb/work/bcbc-fin.pdf.

    Schlagwörter: Categories and Subject Descriptors, F.1.1 [Computation by Abstract Devices, Models of Computation, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—Computations on polynomials, I.1.2 [Symbolic and Algebraic Manipulation, Algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, algebraic complexity, bilinear circuits, cyclic convolution, Fast Fourier Transform, lower bounds, polynomial multiplication, singular values, rigidity

    Dateibeschreibung: application/pdf

    Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.2091

    Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.2091
    http://math-www.upb.de/agpb/work/bcbc-fin.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  5. 5

    Division-free computation of subresultants using Bezout matrices.

    Autoren: Kerber, Michael1 (AUTHOR) mkerber@mpi-inf.mpg.de

    Quelle: International Journal of Computer Mathematics. Dec2009, Vol. 86 Issue 12, p2186-2200. 15p. 2 Charts.

    Schlagwörter: *Algorithms, Polynomials, Matrices (Mathematics), Determinants (Mathematics), Diophantine equations

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  6. 6

    ABSTRACTS from other ACM Publications.

    Quelle: Communications of the ACM; Jul1982, Vol. 25 Issue 7, p487-492, 6p

    Schlagwörter: SEQUENTIAL machine theory, REDUCED instruction set computers, MICROELECTRONICS, INTEGRATED circuits

    Reviews & Products: COMMUNICATIONS of the ACM (Periodical)

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  7. 7

    A Review of Error Estimation in Adaptive Quadrature.

    Autoren: Gonnet, Pedro

    Quelle: ACM Computing Surveys; Aug2012, Vol. 44 Issue 4, p22:1-22:36, 36p, 8 Charts, 6 Graphs

    Schlagwörter: ALGORITHMS, COMPUTER programming, SAMPLING errors, ERROR analysis in mathematics, STATISTICAL sampling, ESTIMATION theory

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  8. 8

    Testing Nilpotence of Galois Groups in Polynomial Time.

    Autoren: Arvind, V. Kurur, Piyush P.

    Quelle: ACM Transactions on Algorithms; 2012, Vol. 8 Issue 3, p1-22, 22p

    Schlagwörter: NILPOTENT groups, GALOIS theory, POLYNOMIALS, ALGORITHMS, SYLOW subgroups, UNIVARIATE analysis

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  9. 9

    Increasing the Reliability of Adaptive Quadrature Using Explicit Interpolants.

    Autoren: GONNET, PEDRO Zürich, ETH

    Quelle: ACM Transactions on Mathematical Software; 2011, Vol. 37 Issue 3, p26-26:32, 32p

    Schlagwörter: ALGORITHMS, INTEGRALS, ERROR analysis in mathematics, NUMERICAL analysis, MATHEMATICAL statistics, STATISTICAL reliability

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten

Suchwerkzeuge: