Výsledky vyhledávání - "Numerical Algorithms and Problems—computations on polynomials"

Explicit Lower Bounds via Geometric Complexity Theory (Extended Abstract)

Autoři: Peter Bürgisser Christian Ikenmeyer The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Peter Bürgisser Christian Ikenmeyer The Pennsylvania State University CiteSeerX Archives

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

Témata: 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

Popis souboru: application/pdf

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

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

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

Autoři: Peter Bürgisser Felipe Cucker The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Peter Bürgisser Felipe Cucker The Pennsylvania State University CiteSeerX Archives

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

Témata: 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

Popis souboru: application/pdf

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

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

On Lacunary Polynomial Perfect Powers

Autoři: Mark Giesbrecht Daniel S: ROche The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Mark Giesbrecht Daniel S: ROche The Pennsylvania State University CiteSeerX Archives

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

Témata: 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

Popis souboru: application/pdf

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

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

Optimal Complexity Lower Bound for Polynomial Multiplication

Autoři: Peter Bürgisser Martin Lotz The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Peter Bürgisser Martin Lotz The Pennsylvania State University CiteSeerX Archives

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

Témata: 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

Popis souboru: application/pdf

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

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

Division-free computation of subresultants using Bezout matrices.

Autoři: Kerber, Michael¹ (AUTHOR) mkerber@mpi-inf.mpg.de

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

Témata: *Algorithms, Polynomials, Matrices (Mathematics), Determinants (Mathematics), Diophantine equations

ABSTRACTS from other ACM Publications.

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

Témata: SEQUENTIAL machine theory, REDUCED instruction set computers, MICROELECTRONICS, INTEGRATED circuits

Reviews & Products: COMMUNICATIONS of the ACM (Periodical)

A Review of Error Estimation in Adaptive Quadrature.

Autoři: Gonnet, Pedro

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

Témata: ALGORITHMS, COMPUTER programming, SAMPLING errors, ERROR analysis in mathematics, STATISTICAL sampling, ESTIMATION theory

Testing Nilpotence of Galois Groups in Polynomial Time.

Autoři: Arvind, V. Kurur, Piyush P.

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

Témata: NILPOTENT groups, GALOIS theory, POLYNOMIALS, ALGORITHMS, SYLOW subgroups, UNIVARIATE analysis

Increasing the Reliability of Adaptive Quadrature Using Explicit Interpolants.

Autoři: GONNET, PEDRO Zürich, ETH

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

Témata: ALGORITHMS, INTEGRALS, ERROR analysis in mathematics, NUMERICAL analysis, MATHEMATICAL statistics, STATISTICAL reliability