๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Complexity of polynomial factorization

โœ Scribed by Kaltofen.


Book ID
127399261
Year
1982
Tongue
English
Weight
359 KB
Edition
PhD Thesis
Category
Library

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Self-witnessing polynomial-time complexi
โœ Michael R. Fellows; Neal Koblitz ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer ๐ŸŒ English โš– 295 KB

Abstracl. For a number of computational search problems, the existence of a polynomial-time algorithm for the problem implies that a polynomial-time algorithm for the problem is constructively known. Some instances of such self-witnessing polynomial-lime complexity are presented. Our main resuk demo

Multivariate polynomial factorization
โœ David R Musser ๐Ÿ“‚ Library ๐Ÿ“… 1974 ๐Ÿ› Mathematics Research Center, University of Wiscons ๐ŸŒ English โš– 340 KB
Factorization of polynomial systems
โœ Corless, Gianni, Trager. ๐Ÿ“‚ Library ๐Ÿ“… 1997 ๐Ÿ› ISSAC ๐ŸŒ English โš– 224 KB
Sparse bivariate polynomial factorizatio
โœ WenYuan Wu,JingWei Chen,Yong Feng ๐Ÿ“‚ Article ๐Ÿ“… 2014 ๐Ÿ› SP Science China Press ๐ŸŒ English โš– 309 KB