Výsledky vyhledávání - "Numerical Algorithms and Problems—Computations on polynomials"
-
1
Autoři:
Přispěvatelé:
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
-
2
Solving polynomial equations in smoothed polynomial time and a near solution to Smale’s 17th problem
Autoři:
Přispěvatelé:
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
-
3
Autoři:
Přispěvatelé:
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
-
4
Autoři:
Přispěvatelé:
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
Nájsť tento článok vo Web of Science