Výsledky vyhledávání - Numerical Algorithms and Problems—Computations on polynomials~
-
1
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
-
2
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
-
3
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, I.1[Symbolic and Algebraic Manipulation, Algorithms, F.2.1[Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—Computations on matrices General Terms, Algorithms Keywords, linear algebra, polynomial matrix, matrix rank, nullspace
Popis souboru: application/pdf
-
4
Autoři:
Přispěvatelé:
Zdroj: ftp://ftp-sop.inria.fr/saga/emiris/publis/CEjacm.ps.gz
Témata: Categories and Subject Descriptors, I.1.2 Algorithms (Algebraic algorithms, Analysis of algorithms). F.2.1 Numerical Algorithms and Problems (Computations on matrices, Computations on polynomials). F.2.2 Nonnumerical Algorithms and Problems (Computations on discrete s, Geometrical problems and computations) General Terms, Algorithms, Theory. Additional Key Words and Phrases, Sparse elimination theory, multivariate resultant, Newton polytope, mixed volume, polyhedral subdivision, eoeective Nullstellensatz, asymptotic complexity
Popis souboru: application/postscript
-
5
Autoři: Kerber, Michael1 (AUTHOR) mkerber@mpi-inf.mpg.de
Zdroj: International Journal of Computer Mathematics. Dec2009, Vol. 86 Issue 12, p2186-2200. 15p. 2 Charts.
-
6
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
-
7
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, I.1[Symbolic and Algebraic Manipulation, Algorithms, F.2.1[Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—Computations on matrices General Terms, Algorithms Keywords, linear algebra, polynomial matrix, matrix rank, nullspace
Popis souboru: application/pdf
-
8
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
-
9
Autoři: a další
Přispěvatelé: a další
Zdroj: ACM Transactions on Mathematical Software. 35:1-42
Témata: [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], Word size Finite fields, [INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC], Matrix Factorization, BLAS level 1-2-3, Linear Algebra Package, Exact Determinant, 01 natural sciences, Exact Inverse, Winograd's symbolic Matrix Multiplication, G.4:Mathematical Software,Algorithm design and analysis, F.2.1:Analysis of Algorithms and Problem Complexity,Numerical Algori thms and Problems[computations in finite fields.], 0101 mathematics
Popis souboru: application/pdf
Přístupová URL adresa: https://hal.archives-ouvertes.fr/hal-00018223/file/dlaff.pdf
https://hal.science/hal-00018223v4
https://doi.org/10.1145/1391989.1391992
https://hal.science/hal-00018223v4/document
https://dblp.uni-trier.de/db/journals/toms/toms35.html#DumasGP08
https://dl.acm.org/citation.cfm?id=1391992
http://portal.acm.org/citation.cfm?doid=1391989.1391992
https://ljk.imag.fr/membres/Jean-Guillaume.Dumas/Publications/dlaff.pdf
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00367191
https://hal.archives-ouvertes.fr/hal-00018223/document -
10
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, C.2.1 [Computer-Communication Networks, Network Architecture and Design—Packet-Switching Network, Store and Forward Networks, F.2.2 [Analysis of Algorithms and Problem Complexity, Non Numerical Algorithms and Problems—Computations on Discrete Structures, Sequencing and Scheduling General Terms, Algorithms, Design, Performance, Theory Additional Key Words and Phrases, Jitter Regulation, Buffer Management, Quality of Service, Buffer Overflow and Underflow, Scheduling, Online Algorithms, Competitive Analysis
Popis souboru: application/pdf
-
11
Autoři: Tsachouridis, Vassilios A.
Témata: 512.9
Přístupová URL adresa: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.697116
-
12
Autoři: a další
Resource Type: eBook.
Témata: Fourier analysis
Categories: MATHEMATICS / Mathematical Analysis, MATHEMATICS / Algebra / Linear, MATHEMATICS / Applied, MATHEMATICS / Numerical Analysis
-
13
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity, Non Numerical Algorithms and Problems—Computations on discrete structures, G.2.2 [Discrete Mathematics, Graph Theory—Network Problems, Trees
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.9819; http://www.andrew.cmu.edu/user/mohits/mbdst.pdf
-
14
Autoři:
Zdroj: ACM Transactions on Mathematical Software; 2013, Vol. 39 Issue 3, p18-18:19, 2p, 2 Charts
-
15
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Non Numerical Algorithms and Problems—Computations on discrete structures, G.2.2 [Discrete Mathematics, Graph Theory—Network Problems, Trees. General Terms, Algorithms, Theory Additional Key Words and Phrases, Approximation algorithms, Spanning Trees, Bounded degree, Iterative rounding. ACM Reference Format
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.433.674; http://www.cse.cuhk.edu.hk/~chi/papers/mbdst.pdf
-
16
-
17
Autoři:
Zdroj: Computational Mechanics; May2010, Vol. 45 Issue 6, p607-621, 15p, 3 Diagrams, 9 Graphs
-
18
Autoři:
Zdroj: International Journal of Quantum Chemistry; 2009, Vol. 109 Issue 8, p1748-1755, 8p, 1 Graph
-
19
Autoři:
Zdroj: IEEE Transactions on Ultrasonics Ferroelectrics & Frequency Control; Sep2004, Vol. 51 Issue 9, p1060-1071, 12p, 8 Diagrams, 1 Chart
-
20
Autoři: a další
Resource Type: eBook.
Témata: Computer software, Numerical analysis, Computer science--Mathematics, Mathematics, Algorithms, Computer algorithms, Computer programs
Categories: MATHEMATICS / Applied, COMPUTERS / Computer Science, COMPUTERS / Programming / Algorithms, COMPUTERS / Mathematical & Statistical Software, SCIENCE / Physics / Mathematical & Computational, MATHEMATICS / Numerical Analysis
Nájsť tento článok vo Web of Science 
Full Text Finder