Zobrazeno 1 - 10 of 1 373 pro vyhledávání: '"Square-free polynomial"'
2
Separation bounds for polynomial systems
Autor: Elias P. Tsigaridas, Ioannis Z. Emiris, Bernard Mourrain
Publikováno v: Journal of Symbolic Computation
Journal of Symbolic Computation, 2020, 101, pp.128-151. ⟨10.1016/j.jsc.2019.07.001⟩
Journal of Symbolic Computation, Elsevier, 2020, 101, pp.128-151. ⟨10.1016/j.jsc.2019.07.001⟩
International audience; We rely on aggregate separation bounds for univariate polynomials to introduce novel worst-case separation bounds for the isolated roots of zero-dimensional, positive-dimensional, and overde- termined polynomial systems. We ex
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::664971a2bb630aa49557091e7d9c7118
https://doi.org/10.1016/j.jsc.2019.07.001
Zobrazit plný text záznamu
3
Robust Polynomial Reconstruction via Chinese Remainder Theorem in the Presence of Small Degree Residue Errors
Autor: Li Xiao, Xiang-Gen Xia
Publikováno v: IEEE Transactions on Circuits and Systems II: Express Briefs. 65:1778-1782
Based on unique decoding of the polynomial residue code with non-pairwise coprime moduli, a polynomial with degree less than that of the least common multiple (lcm) of all the moduli can be accurately reconstructed when the number of residue errors i
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4674c5080dee225cfd0e70408f86597b
https://doi.org/10.1109/tcsii.2017.2756343
Zobrazit plný text záznamu
4
Low complexity bit-parallel multiplier for F2n defined by repeated polynomials
Autor: Seokhie Hong, Nam Su Chang, Eun Sook Kang
Publikováno v: Discrete Applied Mathematics. 241:2-12
Wu recently proposed three types of irreducible polynomials for low-complexity bit-parallel multipliers over F 2 n . In this paper, we consider new classes of irreducible polynomials for low-complexity bit-parallel multipliers over F 2 n , namely, re
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::949993244dbd8a65d2641220fda3039c
https://doi.org/10.1016/j.dam.2016.07.014
Zobrazit plný text záznamu
5
An application of bivariate polynomial factorization on decoding of Reed-Solomon based codes
Autor: Ljubo Nedović, Ivan Pavkov, M Nebojsa Ralevic
Publikováno v: Applicable Analysis and Discrete Mathematics. 12:166-177
A necessary and sufficient condition for the existence of a non-trivial factorization of an arbitrary bivariate polynomial with integer coefficients was presented in [2]. In this paper we develop an efficient algorithm for factoring bivariate polynom
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::054d24d41fee575c3699a8ec04d61f4c
https://doi.org/10.2298/aadm170530005p
Zobrazit plný text záznamu
6
Curve and surface fitting by implicit polynomials: Optimum degree finding and heuristic refinement
Autor: Anselmo Montenegro, Juan M. Otero, Celso C. Ribeiro, Ruben Interian
Publikováno v: Computers & Graphics. 67:14-23
Finding an implicit polynomial that fits a set of observations X is the goal of many researches in recent years. However, most existing algorithms assume the knowledge of the degree of the implicit polynomial that best represents the points. This pap
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::9e8606256edd386349ed5f5e9e58ae74
https://doi.org/10.1016/j.cag.2017.05.002
Zobrazit plný text záznamu
7
Complexity of function systems over a finite field in the class of polarized polynomial forms
Autor: M. M. Gordeev, S. N. Selezneva
Publikováno v: Moscow University Computational Mathematics and Cybernetics. 41:193-198
The Shannon complexity of a function system over a q-element finite field which contains m functions of n variables in the class of polarized polynomial forms is exactly evaluated: L q PPF (n,m) = q n for all n ≥ 1, m ≥ 2, and all possible odd q.
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c2cadf4badff60ae6778064a46f87531
https://doi.org/10.3103/s0278641917040069
Zobrazit plný text záznamu
9
The nearest polynomial to multiple given polynomials with a given zero in the real case
Autor: Hiroshi Sekigawa
Publikováno v: Theoretical Computer Science. 681:167-175
Given multiple univariate or multivariate real polynomials f 1 , … , f n and a desired real zero z, we investigate a problem of finding the nearest polynomial f ˜ to f 1 , … , f n having z as a zero. We use a pair of norms to define the nearest
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::71fbfcf2656563805d98adfd6a183914
https://doi.org/10.1016/j.tcs.2017.03.033
Zobrazit plný text záznamu
10
NP-complete problems for systems of Linear polynomial’s values divisibilities
Autor: Mikhail R. Starchak, N. K. Kosovskii, T. M. Kosovskaya, N. N. Kosovskii
Publikováno v: Vestnik St. Petersburg University, Mathematics. 50:145-152
The paper studies the algorithmic complexity of subproblems for satisfiability in positive integers of simultaneous divisibility of linear polynomials with nonnegative coefficients. In the general case, it is not known whether this problem is in the
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::acedf85f75aabd2ccbde257ce6698c34
https://doi.org/10.3103/s1063454117020078
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje