Výsledky vyhledávání - "CCS Concepts •Computing methodologies → Symbolic calculus algorithms"

On the Bit Complexity of Solving Bilinear Polynomial Systems

Autoři: Emiris, Ioannis Mantzaflaris, Angelos Tsigaridas, Elias

Přispěvatelé: Emiris, Ioannis Mantzaflaris, Angelos Tsigaridas, Elias

Zdroj: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation. :215-222

Témata: polynomial system solving, CCS Concepts •Computing methodologies → Symbolic calculus algorithms, [MATH] Mathematics [math], 0102 computer and information sciences, resultant matrix, [INFO] Computer Science [cs], 16. Peace & justice, 01 natural sciences, Keywords bilinear polynomial, Bilinear Systems, Solving Polynomials, separation bounds, 0101 mathematics, Bit Complexity, DMM

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.inria.fr/hal-01401134/file/bilinear.pdf
https://inria.hal.science/hal-01401134v1
https://inria.hal.science/hal-01401134v1/document
https://doi.org/10.1145/2930889.2930919
https://dl.acm.org/doi/10.1145/2930889.2930919
https://hal.archives-ouvertes.fr/hal-01401134
https://hal.inria.fr/hal-01401134/document
https://dblp.uni-trier.de/db/conf/issac/issac2016.html#EmirisMT16
https://hal.inria.fr/hal-01401134
https://pergamos.lib.uoa.gr/uoa/dl/object/3168352