Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Computing real radicals and S-radicals of polynomial systems

Autor: Mohab Safey El Din, Zhi-Hong Yang, Lihong Zhi

Publikováno v: Journal of Symbolic Computation
Journal of Symbolic Computation, Elsevier, 2021, 102, pp.259-278. ⟨10.1016/j.jsc.2019.10.018⟩
Journal of Symbolic Computation, 2021, 102, pp.259-278. ⟨10.1016/j.jsc.2019.10.018⟩

Let f = ( f 1 , … , f s ) be a sequence of polynomials in Q [ X 1 , … , X n ] of maximal degree D and V ⊂ C n be the algebraic set defined by f and r be its dimension. The real radical 〈 f 〉 r e associated to f is the largest ideal which de

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a9351641463c6b5d26f58ac2781e0424
https://doi.org/10.1016/j.jsc.2019.10.018

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Likelihood Ratio Tests and Singularities

Autor: Drton, Mathias

Publikováno v: The Annals of Statistics, 2009 Apr 01. 37(2), 979-1012.

Externí odkaz: https://www.jstor.org/stable/30243655

The complexity of Dominating set in geometric intersection graphs

Autor: Sándor Kisfaludi-Bak, Gerhard J. Woeginger, Mark de Berg

Publikováno v: Theoretical Computer Science, 769, 18-31. Elsevier

We study the parameterized complexity of the dominating set problem in geometric intersection graphs. • In one dimension, we investigate intersection graphs induced by translates of a fixed pattern Q that consists of a finite number of intervals an

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87b67fa5399d0a5df314afc09268ebda
https://doi.org/10.1016/j.tcs.2018.10.007